./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/libvsync/hclhlock.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/libvsync/hclhlock.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:40:39,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:40:39,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:40:39,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:40:39,277 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:40:39,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:40:39,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:40:39,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:40:39,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:40:39,293 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:40:39,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:40:39,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:40:39,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:40:39,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:40:39,293 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:40:39,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:40:39,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:40:39,295 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:40:39,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:40:39,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:40:39,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:40:39,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:40:39,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:40:39,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:40:39,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b0a2798ee53cc94366daea227ae4e14ebe705512ec93088d5efc9992b9f84ae5 [2025-03-08 17:40:39,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:40:39,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:40:39,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:40:39,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:40:39,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:40:39,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/libvsync/hclhlock.i [2025-03-08 17:40:40,637 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605be2f1/13bff2e6938741a684eee38d099d0bd5/FLAG01b8c2c9e [2025-03-08 17:40:41,045 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:40:41,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i [2025-03-08 17:40:41,078 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605be2f1/13bff2e6938741a684eee38d099d0bd5/FLAG01b8c2c9e [2025-03-08 17:40:41,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3605be2f1/13bff2e6938741a684eee38d099d0bd5 [2025-03-08 17:40:41,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:40:41,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:40:41,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:40:41,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:40:41,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:40:41,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:41" (1/1) ... [2025-03-08 17:40:41,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26eceadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:41, skipping insertion in model container [2025-03-08 17:40:41,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:40:41" (1/1) ... [2025-03-08 17:40:41,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:40:43,012 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-03-08 17:40:43,014 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-03-08 17:40:43,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-03-08 17:40:43,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-03-08 17:40:43,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-03-08 17:40:43,037 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-03-08 17:40:43,038 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-03-08 17:40:43,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-03-08 17:40:43,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-03-08 17:40:43,042 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-03-08 17:40:43,043 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-03-08 17:40:43,044 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-03-08 17:40:43,046 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-03-08 17:40:43,266 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-03-08 17:40:43,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-03-08 17:40:43,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:40:43,287 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:40:43,383 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3755] [2025-03-08 17:40:43,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3757] [2025-03-08 17:40:43,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3762] [2025-03-08 17:40:43,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3764] [2025-03-08 17:40:43,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3770] [2025-03-08 17:40:43,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3772] [2025-03-08 17:40:43,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3778] [2025-03-08 17:40:43,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3780] [2025-03-08 17:40:43,387 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3786] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3788] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3794] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3796] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3802] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3804] [2025-03-08 17:40:43,388 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3810] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3812] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3817] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3819] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3824] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3826] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3831] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3833] [2025-03-08 17:40:43,389 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3838] [2025-03-08 17:40:43,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3840] [2025-03-08 17:40:43,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3845] [2025-03-08 17:40:43,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3847] [2025-03-08 17:40:43,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3852] [2025-03-08 17:40:43,390 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3855] [2025-03-08 17:40:43,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3861] [2025-03-08 17:40:43,394 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3864] [2025-03-08 17:40:43,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3870] [2025-03-08 17:40:43,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3873] [2025-03-08 17:40:43,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3879] [2025-03-08 17:40:43,395 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3882] [2025-03-08 17:40:43,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3888] [2025-03-08 17:40:43,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3891] [2025-03-08 17:40:43,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3897] [2025-03-08 17:40:43,396 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3900] [2025-03-08 17:40:43,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3907] [2025-03-08 17:40:43,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3910] [2025-03-08 17:40:43,397 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3917] [2025-03-08 17:40:43,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3920] [2025-03-08 17:40:43,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3927] [2025-03-08 17:40:43,398 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3930] [2025-03-08 17:40:43,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3937] [2025-03-08 17:40:43,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3940] [2025-03-08 17:40:43,399 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3947] [2025-03-08 17:40:43,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3950] [2025-03-08 17:40:43,400 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3957] [2025-03-08 17:40:43,401 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3960] [2025-03-08 17:40:43,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3966] [2025-03-08 17:40:43,402 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3969] [2025-03-08 17:40:43,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3975] [2025-03-08 17:40:43,403 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3978] [2025-03-08 17:40:43,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3984] [2025-03-08 17:40:43,404 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3987] [2025-03-08 17:40:43,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3993] [2025-03-08 17:40:43,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [3996] [2025-03-08 17:40:43,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4002] [2025-03-08 17:40:43,405 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4005] [2025-03-08 17:40:43,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4011] [2025-03-08 17:40:43,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4014] [2025-03-08 17:40:43,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4020] [2025-03-08 17:40:43,406 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4023] [2025-03-08 17:40:43,407 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4029] [2025-03-08 17:40:43,408 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4032] [2025-03-08 17:40:43,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4038] [2025-03-08 17:40:43,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4041] [2025-03-08 17:40:43,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4047] [2025-03-08 17:40:43,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4050] [2025-03-08 17:40:43,409 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4056] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4059] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4065] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4068] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4074] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4077] [2025-03-08 17:40:43,410 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4083] [2025-03-08 17:40:43,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4086] [2025-03-08 17:40:43,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4092] [2025-03-08 17:40:43,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4095] [2025-03-08 17:40:43,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4101] [2025-03-08 17:40:43,411 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4103] [2025-03-08 17:40:43,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4109] [2025-03-08 17:40:43,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4111] [2025-03-08 17:40:43,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4117] [2025-03-08 17:40:43,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4119] [2025-03-08 17:40:43,412 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4125] [2025-03-08 17:40:43,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4127] [2025-03-08 17:40:43,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4133] [2025-03-08 17:40:43,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4135] [2025-03-08 17:40:43,413 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4141] [2025-03-08 17:40:43,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4143] [2025-03-08 17:40:43,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4149] [2025-03-08 17:40:43,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4151] [2025-03-08 17:40:43,414 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4157] [2025-03-08 17:40:43,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4159] [2025-03-08 17:40:43,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4165] [2025-03-08 17:40:43,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4167] [2025-03-08 17:40:43,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4173] [2025-03-08 17:40:43,415 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ __volatile__("" ::: "memory"); [4175] [2025-03-08 17:40:43,456 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172094,172107] [2025-03-08 17:40:43,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172145,172158] [2025-03-08 17:40:43,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172202,172215] [2025-03-08 17:40:43,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172763,172776] [2025-03-08 17:40:43,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[172814,172827] [2025-03-08 17:40:43,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174060,174073] [2025-03-08 17:40:43,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174118,174131] [2025-03-08 17:40:43,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174622,174635] [2025-03-08 17:40:43,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174679,174692] [2025-03-08 17:40:43,461 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[174746,174759] [2025-03-08 17:40:43,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175274,175287] [2025-03-08 17:40:43,462 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175341,175354] [2025-03-08 17:40:43,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[175944,175957] [2025-03-08 17:40:43,469 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198494,198507] [2025-03-08 17:40:43,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/libvsync/hclhlock.i[198561,198574] [2025-03-08 17:40:43,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:40:43,626 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:40:43,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43 WrapperNode [2025-03-08 17:40:43,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:40:43,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:40:43,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:40:43,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:40:43,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,713 INFO L138 Inliner]: procedures = 921, calls = 957, calls flagged for inlining = 833, calls inlined = 67, statements flattened = 799 [2025-03-08 17:40:43,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:40:43,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:40:43,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:40:43,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:40:43,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,757 INFO L175 MemorySlicer]: Split 50 memory accesses to 4 slices as follows [2, 28, 18, 2]. 56 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 7, 6, 0]. The 15 writes are split as follows [0, 9, 5, 1]. [2025-03-08 17:40:43,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:40:43,819 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:40:43,819 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:40:43,819 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:40:43,821 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (1/1) ... [2025-03-08 17:40:43,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:40:43,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:43,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 17:40:43,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 17:40:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 17:40:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:40:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure run [2025-03-08 17:40:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure run [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 17:40:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 17:40:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 17:40:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 17:40:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 17:40:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 17:40:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 17:40:43,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 17:40:43,874 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:40:44,024 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:40:44,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-9: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-18: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1885-27: havoc vatomic32_read_rlx_#t~ret112#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1920: havoc vatomic32_cmpxchg_rlx_#t~ret117#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1890-9: havoc vatomic32_read_acq_#t~ret113#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-08 17:40:44,586 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2290-9: havoc vatomic32_await_neq_acq_#t~ret175#1; [2025-03-08 17:40:44,587 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3660: havoc vatomicptr_read_acq_#t~ret413#1.base, vatomicptr_read_acq_#t~ret413#1.offset; [2025-03-08 17:40:44,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115: havoc main_~#t~0#1.base, main_~#t~0#1.offset; [2025-03-08 17:40:44,747 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6115-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~0#1.base, main_~#t~0#1.offset); srcloc: null [2025-03-08 17:40:44,748 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:40:44,748 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:40:45,133 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:40:45,133 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:40:45,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:45 BoogieIcfgContainer [2025-03-08 17:40:45,133 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:40:45,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:40:45,135 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:40:45,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:40:45,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:40:41" (1/3) ... [2025-03-08 17:40:45,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bac8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:45, skipping insertion in model container [2025-03-08 17:40:45,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:40:43" (2/3) ... [2025-03-08 17:40:45,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33bac8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:40:45, skipping insertion in model container [2025-03-08 17:40:45,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:40:45" (3/3) ... [2025-03-08 17:40:45,142 INFO L128 eAbstractionObserver]: Analyzing ICFG hclhlock.i [2025-03-08 17:40:45,155 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:40:45,157 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hclhlock.i that has 2 procedures, 225 locations, 1 initial locations, 42 loop locations, and 17 error locations. [2025-03-08 17:40:45,157 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:40:45,317 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:40:45,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 365 transitions, 737 flow [2025-03-08 17:40:45,430 INFO L124 PetriNetUnfolderBase]: 151/393 cut-off events. [2025-03-08 17:40:45,431 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:45,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 393 events. 151/393 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1127 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 298. Up to 8 conditions per place. [2025-03-08 17:40:45,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 365 transitions, 737 flow [2025-03-08 17:40:45,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 365 transitions, 737 flow [2025-03-08 17:40:45,456 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:40:45,466 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ea0d21b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:40:45,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 17:40:45,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:40:45,477 INFO L124 PetriNetUnfolderBase]: 9/25 cut-off events. [2025-03-08 17:40:45,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:40:45,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:45,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:45,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1020487280, now seen corresponding path program 1 times [2025-03-08 17:40:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743744907] [2025-03-08 17:40:45,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:45,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:40:45,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:40:45,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:45,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:45,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:45,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743744907] [2025-03-08 17:40:45,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743744907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:45,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:45,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056891178] [2025-03-08 17:40:45,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:45,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:40:45,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:45,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:40:45,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:40:45,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-08 17:40:45,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 365 transitions, 737 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:45,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:45,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-08 17:40:45,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:46,502 INFO L124 PetriNetUnfolderBase]: 945/2518 cut-off events. [2025-03-08 17:40:46,503 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:46,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 2518 events. 945/2518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16344 event pairs, 696 based on Foata normal form. 1159/3271 useless extension candidates. Maximal degree in co-relation 4147. Up to 1717 conditions per place. [2025-03-08 17:40:46,518 INFO L140 encePairwiseOnDemand]: 255/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/256 dead transitions. [2025-03-08 17:40:46,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 256 transitions, 807 flow [2025-03-08 17:40:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:40:46,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:40:46,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2025-03-08 17:40:46,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4815068493150685 [2025-03-08 17:40:46,534 INFO L175 Difference]: Start difference. First operand has 228 places, 365 transitions, 737 flow. Second operand 4 states and 703 transitions. [2025-03-08 17:40:46,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 256 transitions, 807 flow [2025-03-08 17:40:46,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 256 transitions, 807 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:40:46,542 INFO L231 Difference]: Finished difference. Result has 229 places, 256 transitions, 525 flow [2025-03-08 17:40:46,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=525, PETRI_PLACES=229, PETRI_TRANSITIONS=256} [2025-03-08 17:40:46,545 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 1 predicate places. [2025-03-08 17:40:46,546 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 256 transitions, 525 flow [2025-03-08 17:40:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:46,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:46,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:46,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:40:46,546 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:46,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1435631057, now seen corresponding path program 1 times [2025-03-08 17:40:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502023300] [2025-03-08 17:40:46,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:40:46,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:40:46,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:46,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:46,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502023300] [2025-03-08 17:40:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502023300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201609147] [2025-03-08 17:40:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:46,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:40:46,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:46,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:40:46,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:40:46,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-08 17:40:46,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 256 transitions, 525 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:46,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:46,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-08 17:40:46,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:47,055 INFO L124 PetriNetUnfolderBase]: 945/2516 cut-off events. [2025-03-08 17:40:47,057 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4253 conditions, 2516 events. 945/2516 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16359 event pairs, 696 based on Foata normal form. 1/2113 useless extension candidates. Maximal degree in co-relation 4206. Up to 1717 conditions per place. [2025-03-08 17:40:47,068 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 141 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-03-08 17:40:47,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 254 transitions, 809 flow [2025-03-08 17:40:47,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:40:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:40:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2025-03-08 17:40:47,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4089041095890411 [2025-03-08 17:40:47,071 INFO L175 Difference]: Start difference. First operand has 229 places, 256 transitions, 525 flow. Second operand 4 states and 597 transitions. [2025-03-08 17:40:47,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 254 transitions, 809 flow [2025-03-08 17:40:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 254 transitions, 803 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:40:47,079 INFO L231 Difference]: Finished difference. Result has 227 places, 254 transitions, 521 flow [2025-03-08 17:40:47,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=521, PETRI_PLACES=227, PETRI_TRANSITIONS=254} [2025-03-08 17:40:47,081 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-08 17:40:47,081 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 254 transitions, 521 flow [2025-03-08 17:40:47,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:47,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:47,081 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:47,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:40:47,082 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -956713698, now seen corresponding path program 1 times [2025-03-08 17:40:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903563354] [2025-03-08 17:40:47,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:47,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 17:40:47,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 17:40:47,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:47,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:47,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:47,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903563354] [2025-03-08 17:40:47,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903563354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:47,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:47,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628851493] [2025-03-08 17:40:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:47,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:47,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:47,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:47,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:47,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-08 17:40:47,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 254 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:47,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:47,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-08 17:40:47,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:47,559 INFO L124 PetriNetUnfolderBase]: 945/2519 cut-off events. [2025-03-08 17:40:47,559 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4259 conditions, 2519 events. 945/2519 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16350 event pairs, 696 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 4212. Up to 1724 conditions per place. [2025-03-08 17:40:47,573 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 145 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2025-03-08 17:40:47,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 257 transitions, 821 flow [2025-03-08 17:40:47,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 490 transitions. [2025-03-08 17:40:47,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4474885844748858 [2025-03-08 17:40:47,576 INFO L175 Difference]: Start difference. First operand has 227 places, 254 transitions, 521 flow. Second operand 3 states and 490 transitions. [2025-03-08 17:40:47,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 257 transitions, 821 flow [2025-03-08 17:40:47,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 257 transitions, 815 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:40:47,585 INFO L231 Difference]: Finished difference. Result has 227 places, 255 transitions, 527 flow [2025-03-08 17:40:47,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=227, PETRI_TRANSITIONS=255} [2025-03-08 17:40:47,587 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -1 predicate places. [2025-03-08 17:40:47,587 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 255 transitions, 527 flow [2025-03-08 17:40:47,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:47,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:47,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:47,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:40:47,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:47,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1011647308, now seen corresponding path program 1 times [2025-03-08 17:40:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316511241] [2025-03-08 17:40:47,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:47,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:40:47,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:40:47,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:47,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316511241] [2025-03-08 17:40:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316511241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770683204] [2025-03-08 17:40:47,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:47,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:40:47,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 17:40:47,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 17:40:47,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 17:40:47,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:47,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:47,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 17:40:47,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:40:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:40:47,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:40:47,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770683204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:47,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:40:47,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 17:40:47,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515095779] [2025-03-08 17:40:47,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:47,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:47,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:47,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:40:47,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 365 [2025-03-08 17:40:47,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 255 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:47,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:47,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 365 [2025-03-08 17:40:47,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:48,241 INFO L124 PetriNetUnfolderBase]: 945/2517 cut-off events. [2025-03-08 17:40:48,242 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:48,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4260 conditions, 2517 events. 945/2517 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16345 event pairs, 696 based on Foata normal form. 1/2115 useless extension candidates. Maximal degree in co-relation 4236. Up to 1721 conditions per place. [2025-03-08 17:40:48,249 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 143 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2025-03-08 17:40:48,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 253 transitions, 813 flow [2025-03-08 17:40:48,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:48,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:48,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2025-03-08 17:40:48,252 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4420091324200913 [2025-03-08 17:40:48,253 INFO L175 Difference]: Start difference. First operand has 227 places, 255 transitions, 527 flow. Second operand 3 states and 484 transitions. [2025-03-08 17:40:48,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 253 transitions, 813 flow [2025-03-08 17:40:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 253 transitions, 811 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:40:48,257 INFO L231 Difference]: Finished difference. Result has 226 places, 253 transitions, 525 flow [2025-03-08 17:40:48,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=226, PETRI_TRANSITIONS=253} [2025-03-08 17:40:48,258 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, -2 predicate places. [2025-03-08 17:40:48,259 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 253 transitions, 525 flow [2025-03-08 17:40:48,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:48,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:48,259 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:48,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 17:40:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:48,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:48,460 INFO L85 PathProgramCache]: Analyzing trace with hash -876595907, now seen corresponding path program 1 times [2025-03-08 17:40:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244228613] [2025-03-08 17:40:48,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:48,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:48,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:48,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:48,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:48,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244228613] [2025-03-08 17:40:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244228613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676073478] [2025-03-08 17:40:48,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:48,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:40:48,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:40:48,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:48,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:48,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 17:40:48,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:40:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:48,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:40:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 17:40:48,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676073478] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:48,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:40:48,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 6 [2025-03-08 17:40:48,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718450817] [2025-03-08 17:40:48,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:48,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:48,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:48,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:48,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:40:48,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-08 17:40:48,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 253 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:48,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:48,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-08 17:40:48,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:49,061 INFO L124 PetriNetUnfolderBase]: 945/2518 cut-off events. [2025-03-08 17:40:49,061 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:40:49,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4264 conditions, 2518 events. 945/2518 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16233 event pairs, 696 based on Foata normal form. 1/2117 useless extension candidates. Maximal degree in co-relation 4231. Up to 1720 conditions per place. [2025-03-08 17:40:49,070 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 143 selfloop transitions, 3 changer transitions 0/254 dead transitions. [2025-03-08 17:40:49,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 254 transitions, 821 flow [2025-03-08 17:40:49,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2025-03-08 17:40:49,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.445662100456621 [2025-03-08 17:40:49,072 INFO L175 Difference]: Start difference. First operand has 226 places, 253 transitions, 525 flow. Second operand 3 states and 488 transitions. [2025-03-08 17:40:49,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 254 transitions, 821 flow [2025-03-08 17:40:49,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 254 transitions, 815 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:40:49,075 INFO L231 Difference]: Finished difference. Result has 228 places, 254 transitions, 539 flow [2025-03-08 17:40:49,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=228, PETRI_TRANSITIONS=254} [2025-03-08 17:40:49,076 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 0 predicate places. [2025-03-08 17:40:49,076 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 254 transitions, 539 flow [2025-03-08 17:40:49,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:49,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:49,076 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:49,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 17:40:49,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:49,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:49,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:49,278 INFO L85 PathProgramCache]: Analyzing trace with hash 201288723, now seen corresponding path program 1 times [2025-03-08 17:40:49,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:49,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166344643] [2025-03-08 17:40:49,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:49,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:49,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:49,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:49,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:49,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:49,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166344643] [2025-03-08 17:40:49,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166344643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:49,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937777023] [2025-03-08 17:40:49,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:49,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:49,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:49,380 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:40:49,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:40:49,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 17:40:49,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 17:40:49,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:49,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:49,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 17:40:49,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:40:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:49,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:40:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937777023] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:40:49,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:40:49,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 17:40:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080852521] [2025-03-08 17:40:49,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:40:49,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 17:40:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:49,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 17:40:49,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:40:49,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-08 17:40:49,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 254 transitions, 539 flow. Second operand has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:49,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:49,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-08 17:40:49,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:50,051 INFO L124 PetriNetUnfolderBase]: 945/2521 cut-off events. [2025-03-08 17:40:50,052 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 17:40:50,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4277 conditions, 2521 events. 945/2521 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16210 event pairs, 696 based on Foata normal form. 1/2120 useless extension candidates. Maximal degree in co-relation 4234. Up to 1723 conditions per place. [2025-03-08 17:40:50,062 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 146 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2025-03-08 17:40:50,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 259 transitions, 853 flow [2025-03-08 17:40:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:40:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:40:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2025-03-08 17:40:50,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39506849315068493 [2025-03-08 17:40:50,065 INFO L175 Difference]: Start difference. First operand has 228 places, 254 transitions, 539 flow. Second operand 5 states and 721 transitions. [2025-03-08 17:40:50,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 259 transitions, 853 flow [2025-03-08 17:40:50,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 259 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:40:50,069 INFO L231 Difference]: Finished difference. Result has 232 places, 256 transitions, 559 flow [2025-03-08 17:40:50,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=559, PETRI_PLACES=232, PETRI_TRANSITIONS=256} [2025-03-08 17:40:50,070 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-08 17:40:50,070 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 256 transitions, 559 flow [2025-03-08 17:40:50,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:50,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:50,071 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:50,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:40:50,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:50,272 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:50,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2132910143, now seen corresponding path program 2 times [2025-03-08 17:40:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:50,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759571250] [2025-03-08 17:40:50,272 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:40:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:50,284 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-08 17:40:50,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 22 statements. [2025-03-08 17:40:50,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:40:50,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:50,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:40:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759571250] [2025-03-08 17:40:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759571250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:50,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:50,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:40:50,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295430828] [2025-03-08 17:40:50,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:50,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:40:50,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:50,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:40:50,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:40:50,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-08 17:40:50,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 256 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:50,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:50,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-08 17:40:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:50,843 INFO L124 PetriNetUnfolderBase]: 945/2519 cut-off events. [2025-03-08 17:40:50,843 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-08 17:40:50,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 2519 events. 945/2519 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16205 event pairs, 696 based on Foata normal form. 1/2118 useless extension candidates. Maximal degree in co-relation 4235. Up to 1724 conditions per place. [2025-03-08 17:40:50,850 INFO L140 encePairwiseOnDemand]: 360/365 looper letters, 143 selfloop transitions, 5 changer transitions 0/254 dead transitions. [2025-03-08 17:40:50,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 254 transitions, 851 flow [2025-03-08 17:40:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:40:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:40:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2025-03-08 17:40:50,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40616438356164386 [2025-03-08 17:40:50,852 INFO L175 Difference]: Start difference. First operand has 232 places, 256 transitions, 559 flow. Second operand 4 states and 593 transitions. [2025-03-08 17:40:50,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 254 transitions, 851 flow [2025-03-08 17:40:50,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 254 transitions, 845 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 17:40:50,855 INFO L231 Difference]: Finished difference. Result has 232 places, 254 transitions, 559 flow [2025-03-08 17:40:50,856 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=559, PETRI_PLACES=232, PETRI_TRANSITIONS=254} [2025-03-08 17:40:50,856 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 4 predicate places. [2025-03-08 17:40:50,856 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 254 transitions, 559 flow [2025-03-08 17:40:50,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:50,857 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:50,857 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:50,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:40:50,857 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:50,858 INFO L85 PathProgramCache]: Analyzing trace with hash 28661859, now seen corresponding path program 1 times [2025-03-08 17:40:50,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:50,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52072323] [2025-03-08 17:40:50,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:50,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:50,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 17:40:50,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 17:40:50,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:50,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:50,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:40:50,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52072323] [2025-03-08 17:40:50,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52072323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:50,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [154074352] [2025-03-08 17:40:50,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:50,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:50,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:50,982 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:40:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:40:51,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 17:40:51,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 17:40:51,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:51,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:51,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 17:40:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:40:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:40:51,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:40:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 17:40:51,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [154074352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:40:51,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:40:51,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-03-08 17:40:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300686446] [2025-03-08 17:40:51,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:40:51,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:40:51,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:51,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:40:51,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:40:51,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 365 [2025-03-08 17:40:51,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 254 transitions, 559 flow. Second operand has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:51,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:51,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 365 [2025-03-08 17:40:51,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:51,857 INFO L124 PetriNetUnfolderBase]: 951/2565 cut-off events. [2025-03-08 17:40:51,857 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 17:40:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4367 conditions, 2565 events. 951/2565 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16258 event pairs, 696 based on Foata normal form. 2/2166 useless extension candidates. Maximal degree in co-relation 4320. Up to 1723 conditions per place. [2025-03-08 17:40:51,870 INFO L140 encePairwiseOnDemand]: 361/365 looper letters, 165 selfloop transitions, 5 changer transitions 0/276 dead transitions. [2025-03-08 17:40:51,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 276 transitions, 967 flow [2025-03-08 17:40:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:40:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 17:40:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 739 transitions. [2025-03-08 17:40:51,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40493150684931506 [2025-03-08 17:40:51,873 INFO L175 Difference]: Start difference. First operand has 232 places, 254 transitions, 559 flow. Second operand 5 states and 739 transitions. [2025-03-08 17:40:51,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 276 transitions, 967 flow [2025-03-08 17:40:51,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 276 transitions, 941 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 17:40:51,876 INFO L231 Difference]: Finished difference. Result has 236 places, 257 transitions, 585 flow [2025-03-08 17:40:51,877 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=585, PETRI_PLACES=236, PETRI_TRANSITIONS=257} [2025-03-08 17:40:51,877 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 8 predicate places. [2025-03-08 17:40:51,877 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 257 transitions, 585 flow [2025-03-08 17:40:51,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.44444444444444) internal successors, (1066), 9 states have internal predecessors, (1066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:51,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:51,878 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:51,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:40:52,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:52,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:52,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1474815827, now seen corresponding path program 2 times [2025-03-08 17:40:52,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:52,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334420353] [2025-03-08 17:40:52,079 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:40:52,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:52,102 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-08 17:40:52,146 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 17:40:52,147 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:40:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:40:52,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334420353] [2025-03-08 17:40:52,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334420353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:40:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047194695] [2025-03-08 17:40:52,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:40:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:40:52,554 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:40:52,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:40:52,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-08 17:40:52,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-08 17:40:52,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:40:52,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:52,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 17:40:52,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:40:52,851 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:40:52,851 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:40:53,008 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 17:40:53,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047194695] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:40:53,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:40:53,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-08 17:40:53,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463566433] [2025-03-08 17:40:53,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:40:53,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:40:53,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:53,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:40:53,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:40:53,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 365 [2025-03-08 17:40:53,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 257 transitions, 585 flow. Second operand has 15 states, 15 states have (on average 113.53333333333333) internal successors, (1703), 15 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:53,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:53,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 365 [2025-03-08 17:40:53,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:54,528 INFO L124 PetriNetUnfolderBase]: 953/2601 cut-off events. [2025-03-08 17:40:54,528 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 17:40:54,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4444 conditions, 2601 events. 953/2601 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16406 event pairs, 696 based on Foata normal form. 2/2194 useless extension candidates. Maximal degree in co-relation 4395. Up to 1723 conditions per place. [2025-03-08 17:40:54,535 INFO L140 encePairwiseOnDemand]: 354/365 looper letters, 173 selfloop transitions, 27 changer transitions 0/304 dead transitions. [2025-03-08 17:40:54,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 304 transitions, 1101 flow [2025-03-08 17:40:54,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:40:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-08 17:40:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2180 transitions. [2025-03-08 17:40:54,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3318112633181126 [2025-03-08 17:40:54,540 INFO L175 Difference]: Start difference. First operand has 236 places, 257 transitions, 585 flow. Second operand 18 states and 2180 transitions. [2025-03-08 17:40:54,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 304 transitions, 1101 flow [2025-03-08 17:40:54,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 304 transitions, 1101 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:40:54,544 INFO L231 Difference]: Finished difference. Result has 263 places, 281 transitions, 774 flow [2025-03-08 17:40:54,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=774, PETRI_PLACES=263, PETRI_TRANSITIONS=281} [2025-03-08 17:40:54,544 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 35 predicate places. [2025-03-08 17:40:54,544 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 281 transitions, 774 flow [2025-03-08 17:40:54,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 113.53333333333333) internal successors, (1703), 15 states have internal predecessors, (1703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:54,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:54,545 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:54,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:40:54,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:40:54,746 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:54,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:54,746 INFO L85 PathProgramCache]: Analyzing trace with hash -310188377, now seen corresponding path program 1 times [2025-03-08 17:40:54,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:54,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472332464] [2025-03-08 17:40:54,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:54,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:54,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 17:40:54,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 17:40:54,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:54,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 17:40:54,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472332464] [2025-03-08 17:40:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472332464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:54,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:54,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:54,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127053553] [2025-03-08 17:40:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:54,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:40:54,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:54,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:40:54,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:40:54,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 365 [2025-03-08 17:40:54,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 281 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:54,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:54,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 365 [2025-03-08 17:40:54,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:40:55,315 INFO L124 PetriNetUnfolderBase]: 945/2573 cut-off events. [2025-03-08 17:40:55,315 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-08 17:40:55,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4461 conditions, 2573 events. 945/2573 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 16323 event pairs, 696 based on Foata normal form. 4/2176 useless extension candidates. Maximal degree in co-relation 4401. Up to 1757 conditions per place. [2025-03-08 17:40:55,328 INFO L140 encePairwiseOnDemand]: 362/365 looper letters, 162 selfloop transitions, 6 changer transitions 0/271 dead transitions. [2025-03-08 17:40:55,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 271 transitions, 1066 flow [2025-03-08 17:40:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:40:55,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:40:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2025-03-08 17:40:55,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4383561643835616 [2025-03-08 17:40:55,329 INFO L175 Difference]: Start difference. First operand has 263 places, 281 transitions, 774 flow. Second operand 3 states and 480 transitions. [2025-03-08 17:40:55,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 271 transitions, 1066 flow [2025-03-08 17:40:55,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 271 transitions, 1047 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-08 17:40:55,335 INFO L231 Difference]: Finished difference. Result has 257 places, 271 transitions, 723 flow [2025-03-08 17:40:55,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=365, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=257, PETRI_TRANSITIONS=271} [2025-03-08 17:40:55,336 INFO L279 CegarLoopForPetriNet]: 228 programPoint places, 29 predicate places. [2025-03-08 17:40:55,336 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 271 transitions, 723 flow [2025-03-08 17:40:55,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:55,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:55,337 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:55,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:40:55,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2025-03-08 17:40:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash 722502359, now seen corresponding path program 1 times [2025-03-08 17:40:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984528408] [2025-03-08 17:40:55,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:55,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 17:40:55,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 17:40:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:55,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:40:55,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:40:55,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 17:40:55,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 17:40:55,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:55,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:40:55,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:40:55,567 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:40:55,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 29 remaining) [2025-03-08 17:40:55,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2025-03-08 17:40:55,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2025-03-08 17:40:55,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2025-03-08 17:40:55,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2025-03-08 17:40:55,569 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2025-03-08 17:40:55,570 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr10ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr5ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr4ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr8ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr7ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2025-03-08 17:40:55,571 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location runErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2025-03-08 17:40:55,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:40:55,572 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:55,574 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 17:40:55,574 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 17:40:55,683 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 17:40:55,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 395 places, 636 transitions, 1288 flow [2025-03-08 17:40:55,750 INFO L124 PetriNetUnfolderBase]: 275/714 cut-off events. [2025-03-08 17:40:55,750 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 17:40:55,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 714 events. 275/714 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2839 event pairs, 0 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 587. Up to 12 conditions per place. [2025-03-08 17:40:55,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 395 places, 636 transitions, 1288 flow [2025-03-08 17:40:55,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 395 places, 636 transitions, 1288 flow [2025-03-08 17:40:55,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:40:55,774 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7ea0d21b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:40:55,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2025-03-08 17:40:55,776 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:40:55,776 INFO L124 PetriNetUnfolderBase]: 9/25 cut-off events. [2025-03-08 17:40:55,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 17:40:55,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:40:55,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:40:55,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-03-08 17:40:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:40:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash -32612852, now seen corresponding path program 1 times [2025-03-08 17:40:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:40:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526456589] [2025-03-08 17:40:55,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:40:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:40:55,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 17:40:55,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 17:40:55,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:40:55,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:40:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:40:55,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:40:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526456589] [2025-03-08 17:40:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526456589] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:40:55,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:40:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:40:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464882592] [2025-03-08 17:40:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:40:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:40:55,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:40:55,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:40:55,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:40:55,813 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-08 17:40:55,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 636 transitions, 1288 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:40:55,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:40:55,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-08 17:40:55,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:41:16,422 INFO L124 PetriNetUnfolderBase]: 174371/294669 cut-off events. [2025-03-08 17:41:16,422 INFO L125 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2025-03-08 17:41:16,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538022 conditions, 294669 events. 174371/294669 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 4071. Compared 2878920 event pairs, 132336 based on Foata normal form. 140795/392431 useless extension candidates. Maximal degree in co-relation 515450. Up to 242895 conditions per place. [2025-03-08 17:41:17,916 INFO L140 encePairwiseOnDemand]: 448/636 looper letters, 253 selfloop transitions, 3 changer transitions 0/449 dead transitions. [2025-03-08 17:41:17,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 449 transitions, 1426 flow [2025-03-08 17:41:17,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:41:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:41:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1217 transitions. [2025-03-08 17:41:17,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4783805031446541 [2025-03-08 17:41:17,919 INFO L175 Difference]: Start difference. First operand has 395 places, 636 transitions, 1288 flow. Second operand 4 states and 1217 transitions. [2025-03-08 17:41:17,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 449 transitions, 1426 flow [2025-03-08 17:41:17,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 449 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 17:41:17,927 INFO L231 Difference]: Finished difference. Result has 396 places, 449 transitions, 920 flow [2025-03-08 17:41:17,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=636, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=920, PETRI_PLACES=396, PETRI_TRANSITIONS=449} [2025-03-08 17:41:17,929 INFO L279 CegarLoopForPetriNet]: 395 programPoint places, 1 predicate places. [2025-03-08 17:41:17,929 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 449 transitions, 920 flow [2025-03-08 17:41:17,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:17,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:41:17,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:41:17,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:41:17,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2025-03-08 17:41:17,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:41:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1276057813, now seen corresponding path program 1 times [2025-03-08 17:41:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:41:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607271234] [2025-03-08 17:41:17,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:41:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:41:17,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 17:41:17,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 17:41:17,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:41:17,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:41:17,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 17:41:17,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:41:17,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607271234] [2025-03-08 17:41:17,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607271234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:41:17,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:41:17,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:41:17,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255844401] [2025-03-08 17:41:17,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:41:17,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:41:17,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:41:17,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:41:17,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:41:17,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 636 [2025-03-08 17:41:17,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 449 transitions, 920 flow. Second operand has 4 states, 4 states have (on average 196.0) internal successors, (784), 4 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 17:41:17,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:41:17,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 636 [2025-03-08 17:41:17,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand