./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-04 16:30:12,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 16:30:12,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 16:30:12,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 16:30:12,420 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 16:30:12,447 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 16:30:12,448 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 16:30:12,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 16:30:12,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 16:30:12,453 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 16:30:12,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 16:30:12,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 16:30:12,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 16:30:12,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 16:30:12,457 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 16:30:12,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 16:30:12,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 16:30:12,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 16:30:12,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 16:30:12,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 16:30:12,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 16:30:12,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 16:30:12,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 16:30:12,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 16:30:12,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 16:30:12,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 16:30:12,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 16:30:12,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 16:30:12,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 16:30:12,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 16:30:12,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 16:30:12,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 16:30:12,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:12,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 16:30:12,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 16:30:12,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 16:30:12,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 16:30:12,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 16:30:12,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 16:30:12,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 16:30:12,478 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 16:30:12,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 16:30:12,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 16:30:12,479 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 16:30:12,738 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 16:30:12,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 16:30:12,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 16:30:12,763 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 16:30:12,764 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 16:30:12,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix000.opt.yml/witness.yml [2024-06-04 16:30:12,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 16:30:12,939 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 16:30:12,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-04 16:30:14,146 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 16:30:14,418 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 16:30:14,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2024-06-04 16:30:14,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495040b39/3e72a60a98d049c181e0889ee1cf47e4/FLAG08f9cb996 [2024-06-04 16:30:14,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/495040b39/3e72a60a98d049c181e0889ee1cf47e4 [2024-06-04 16:30:14,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 16:30:14,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 16:30:14,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:14,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 16:30:14,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 16:30:14,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:12" (1/2) ... [2024-06-04 16:30:14,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cb4560 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:14, skipping insertion in model container [2024-06-04 16:30:14,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:12" (1/2) ... [2024-06-04 16:30:14,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@79be0cec and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 04:30:14, skipping insertion in model container [2024-06-04 16:30:14,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:14" (2/2) ... [2024-06-04 16:30:14,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33cb4560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:14, skipping insertion in model container [2024-06-04 16:30:14,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 04:30:14" (2/2) ... [2024-06-04 16:30:14,464 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 16:30:14,537 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 16:30:14,539 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-04 16:30:14,540 INFO L97 edCorrectnessWitness]: Location invariant before [L829-L829] (((((((((((((((((! multithreaded || x$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )x) - (long long )y >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (1LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )y >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || ((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1))) [2024-06-04 16:30:14,540 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 16:30:14,540 INFO L106 edCorrectnessWitness]: ghost_update [L827-L827] multithreaded = 1; [2024-06-04 16:30:14,591 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 16:30:15,011 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:15,021 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 16:30:15,325 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 16:30:15,362 INFO L206 MainTranslator]: Completed translation [2024-06-04 16:30:15,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15 WrapperNode [2024-06-04 16:30:15,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 16:30:15,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:15,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 16:30:15,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 16:30:15,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,571 INFO L138 Inliner]: procedures = 174, calls = 38, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2024-06-04 16:30:15,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 16:30:15,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 16:30:15,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 16:30:15,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 16:30:15,585 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,604 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,653 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 16:30:15,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 16:30:15,737 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 16:30:15,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 16:30:15,738 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 16:30:15,738 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (1/1) ... [2024-06-04 16:30:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 16:30:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 16:30:15,769 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) [2024-06-04 16:30:15,799 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 [2024-06-04 16:30:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 16:30:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 16:30:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 16:30:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 16:30:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 16:30:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 16:30:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 16:30:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 16:30:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 16:30:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 16:30:15,823 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 16:30:15,985 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 16:30:15,987 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 16:30:16,999 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 16:30:16,999 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 16:30:17,258 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 16:30:17,259 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 16:30:17,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:17 BoogieIcfgContainer [2024-06-04 16:30:17,262 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 16:30:17,264 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 16:30:17,265 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 16:30:17,268 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 16:30:17,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 04:30:12" (1/4) ... [2024-06-04 16:30:17,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1304a389 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 04:30:17, skipping insertion in model container [2024-06-04 16:30:17,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 04:30:14" (2/4) ... [2024-06-04 16:30:17,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1304a389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:30:17, skipping insertion in model container [2024-06-04 16:30:17,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 04:30:15" (3/4) ... [2024-06-04 16:30:17,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1304a389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 04:30:17, skipping insertion in model container [2024-06-04 16:30:17,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 04:30:17" (4/4) ... [2024-06-04 16:30:17,276 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2024-06-04 16:30:17,293 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 16:30:17,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 16:30:17,293 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 16:30:17,383 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 16:30:17,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 16:30:17,485 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2024-06-04 16:30:17,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:17,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 16:30:17,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 32 transitions, 72 flow [2024-06-04 16:30:17,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 24 transitions, 54 flow [2024-06-04 16:30:17,505 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 16:30:17,513 INFO L357 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, mHoare=false, 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;@6579f1ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 16:30:17,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 16:30:17,522 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 16:30:17,522 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 16:30:17,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 16:30:17,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:17,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 16:30:17,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:17,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:17,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1642904383, now seen corresponding path program 1 times [2024-06-04 16:30:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:17,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000780100] [2024-06-04 16:30:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:23,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000780100] [2024-06-04 16:30:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000780100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:23,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:23,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 16:30:23,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140213083] [2024-06-04 16:30:23,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:23,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 16:30:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 16:30:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 16:30:23,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2024-06-04 16:30:23,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-06-04 16:30:23,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:23,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2024-06-04 16:30:23,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:23,988 INFO L124 PetriNetUnfolderBase]: 131/262 cut-off events. [2024-06-04 16:30:23,988 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-04 16:30:23,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 262 events. 131/262 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1025 event pairs, 75 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 506. Up to 235 conditions per place. [2024-06-04 16:30:23,993 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 22 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2024-06-04 16:30:23,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 119 flow [2024-06-04 16:30:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 16:30:23,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 16:30:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-06-04 16:30:24,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-06-04 16:30:24,006 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 54 flow. Second operand 3 states and 57 transitions. [2024-06-04 16:30:24,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 119 flow [2024-06-04 16:30:24,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:24,011 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 73 flow [2024-06-04 16:30:24,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-04 16:30:24,016 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-04 16:30:24,016 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 73 flow [2024-06-04 16:30:24,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2024-06-04 16:30:24,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:24,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:24,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 16:30:24,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:24,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:24,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1717139950, now seen corresponding path program 1 times [2024-06-04 16:30:24,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:24,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374006157] [2024-06-04 16:30:24,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:24,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374006157] [2024-06-04 16:30:29,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374006157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:29,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:29,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 16:30:29,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687153954] [2024-06-04 16:30:29,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:29,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 16:30:29,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:29,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 16:30:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-04 16:30:29,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:30:29,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-06-04 16:30:29,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:29,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:30:29,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:29,484 INFO L124 PetriNetUnfolderBase]: 186/342 cut-off events. [2024-06-04 16:30:29,485 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-04 16:30:29,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 342 events. 186/342 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1273 event pairs, 94 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 771. Up to 319 conditions per place. [2024-06-04 16:30:29,488 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-06-04 16:30:29,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 165 flow [2024-06-04 16:30:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 16:30:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 16:30:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-04 16:30:29,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234375 [2024-06-04 16:30:29,493 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 73 flow. Second operand 4 states and 67 transitions. [2024-06-04 16:30:29,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 165 flow [2024-06-04 16:30:29,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 16:30:29,497 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 97 flow [2024-06-04 16:30:29,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-04 16:30:29,498 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-04 16:30:29,499 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 97 flow [2024-06-04 16:30:29,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2024-06-04 16:30:29,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:29,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:29,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 16:30:29,500 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:29,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:29,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1683688252, now seen corresponding path program 1 times [2024-06-04 16:30:29,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977822156] [2024-06-04 16:30:29,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:29,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977822156] [2024-06-04 16:30:34,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977822156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 16:30:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672836788] [2024-06-04 16:30:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:34,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 16:30:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:34,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 16:30:34,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-04 16:30:34,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:30:34,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-06-04 16:30:34,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:34,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:30:34,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:34,468 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2024-06-04 16:30:34,469 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-06-04 16:30:34,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 337 events. 183/337 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1246 event pairs, 73 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 843. Up to 305 conditions per place. [2024-06-04 16:30:34,473 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 32 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-04 16:30:34,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 213 flow [2024-06-04 16:30:34,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-04 16:30:34,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50625 [2024-06-04 16:30:34,478 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 97 flow. Second operand 5 states and 81 transitions. [2024-06-04 16:30:34,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 213 flow [2024-06-04 16:30:34,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 16:30:34,482 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 121 flow [2024-06-04 16:30:34,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-06-04 16:30:34,484 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-04 16:30:34,484 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 121 flow [2024-06-04 16:30:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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) [2024-06-04 16:30:34,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:34,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:34,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 16:30:34,485 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:34,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash 654729215, now seen corresponding path program 1 times [2024-06-04 16:30:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831163351] [2024-06-04 16:30:34,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:39,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:39,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831163351] [2024-06-04 16:30:39,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831163351] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:39,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:39,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151307819] [2024-06-04 16:30:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:39,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:39,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:39,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:39,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:39,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:30:39,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 121 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-04 16:30:39,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:39,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:30:39,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:40,258 INFO L124 PetriNetUnfolderBase]: 180/332 cut-off events. [2024-06-04 16:30:40,259 INFO L125 PetriNetUnfolderBase]: For 332/332 co-relation queries the response was YES. [2024-06-04 16:30:40,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 332 events. 180/332 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1216 event pairs, 52 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 910. Up to 291 conditions per place. [2024-06-04 16:30:40,261 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 9 changer transitions 0/48 dead transitions. [2024-06-04 16:30:40,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 261 flow [2024-06-04 16:30:40,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:30:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:30:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-04 16:30:40,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2024-06-04 16:30:40,264 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 121 flow. Second operand 6 states and 95 transitions. [2024-06-04 16:30:40,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 261 flow [2024-06-04 16:30:40,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:40,266 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 145 flow [2024-06-04 16:30:40,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-06-04 16:30:40,267 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 10 predicate places. [2024-06-04 16:30:40,267 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 145 flow [2024-06-04 16:30:40,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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) [2024-06-04 16:30:40,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:40,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:40,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 16:30:40,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:40,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:40,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1621724491, now seen corresponding path program 1 times [2024-06-04 16:30:40,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:40,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144110814] [2024-06-04 16:30:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144110814] [2024-06-04 16:30:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144110814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:47,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 16:30:47,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762545342] [2024-06-04 16:30:47,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:47,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 16:30:47,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:47,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 16:30:47,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-04 16:30:47,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:30:47,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 145 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) [2024-06-04 16:30:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:30:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:47,546 INFO L124 PetriNetUnfolderBase]: 137/284 cut-off events. [2024-06-04 16:30:47,547 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-06-04 16:30:47,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 284 events. 137/284 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 42 based on Foata normal form. 1/283 useless extension candidates. Maximal degree in co-relation 816. Up to 243 conditions per place. [2024-06-04 16:30:47,549 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2024-06-04 16:30:47,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 229 flow [2024-06-04 16:30:47,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 16:30:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 16:30:47,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-04 16:30:47,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-04 16:30:47,552 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 145 flow. Second operand 5 states and 74 transitions. [2024-06-04 16:30:47,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 229 flow [2024-06-04 16:30:47,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 208 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 16:30:47,558 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 151 flow [2024-06-04 16:30:47,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-04 16:30:47,563 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-04 16:30:47,563 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 151 flow [2024-06-04 16:30:47,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) [2024-06-04 16:30:47,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:47,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:47,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 16:30:47,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:47,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:47,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2129581982, now seen corresponding path program 1 times [2024-06-04 16:30:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:47,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710813481] [2024-06-04 16:30:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:30:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:30:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:30:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710813481] [2024-06-04 16:30:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710813481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:30:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:30:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:30:52,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024336667] [2024-06-04 16:30:52,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:30:52,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:30:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:30:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:30:52,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:30:52,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:30:52,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 151 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2024-06-04 16:30:52,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:30:52,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:30:52,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:30:53,193 INFO L124 PetriNetUnfolderBase]: 174/321 cut-off events. [2024-06-04 16:30:53,193 INFO L125 PetriNetUnfolderBase]: For 646/646 co-relation queries the response was YES. [2024-06-04 16:30:53,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 321 events. 174/321 cut-off events. For 646/646 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1150 event pairs, 29 based on Foata normal form. 4/323 useless extension candidates. Maximal degree in co-relation 989. Up to 262 conditions per place. [2024-06-04 16:30:53,196 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 38 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-04 16:30:53,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 281 flow [2024-06-04 16:30:53,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:30:53,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:30:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-04 16:30:53,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-04 16:30:53,198 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 151 flow. Second operand 7 states and 104 transitions. [2024-06-04 16:30:53,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 281 flow [2024-06-04 16:30:53,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 270 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 16:30:53,200 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 154 flow [2024-06-04 16:30:53,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-06-04 16:30:53,201 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2024-06-04 16:30:53,202 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 154 flow [2024-06-04 16:30:53,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 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) [2024-06-04 16:30:53,202 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:30:53,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:30:53,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 16:30:53,202 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:30:53,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:30:53,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1276874622, now seen corresponding path program 1 times [2024-06-04 16:30:53,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:30:53,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671178785] [2024-06-04 16:30:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:30:53,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:30:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:00,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:00,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671178785] [2024-06-04 16:31:00,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671178785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:00,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:00,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:31:00,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290970970] [2024-06-04 16:31:00,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:00,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:31:00,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:00,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:31:00,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:31:00,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:31:00,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-06-04 16:31:00,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:00,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:31:00,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:01,189 INFO L124 PetriNetUnfolderBase]: 131/271 cut-off events. [2024-06-04 16:31:01,189 INFO L125 PetriNetUnfolderBase]: For 682/682 co-relation queries the response was YES. [2024-06-04 16:31:01,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 271 events. 131/271 cut-off events. For 682/682 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1023 event pairs, 37 based on Foata normal form. 1/270 useless extension candidates. Maximal degree in co-relation 856. Up to 229 conditions per place. [2024-06-04 16:31:01,192 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 27 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2024-06-04 16:31:01,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 246 flow [2024-06-04 16:31:01,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:31:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:31:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-04 16:31:01,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4427083333333333 [2024-06-04 16:31:01,194 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 154 flow. Second operand 6 states and 85 transitions. [2024-06-04 16:31:01,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 246 flow [2024-06-04 16:31:01,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 220 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:01,198 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 161 flow [2024-06-04 16:31:01,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2024-06-04 16:31:01,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2024-06-04 16:31:01,199 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 161 flow [2024-06-04 16:31:01,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 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) [2024-06-04 16:31:01,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:01,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:01,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 16:31:01,200 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:01,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:01,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2075778054, now seen corresponding path program 1 times [2024-06-04 16:31:01,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937841864] [2024-06-04 16:31:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:07,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:07,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937841864] [2024-06-04 16:31:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937841864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:07,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:31:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575555371] [2024-06-04 16:31:07,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:07,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:31:07,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:07,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:31:07,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:31:07,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:07,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 161 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 16:31:07,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:07,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:07,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:07,523 INFO L124 PetriNetUnfolderBase]: 173/320 cut-off events. [2024-06-04 16:31:07,523 INFO L125 PetriNetUnfolderBase]: For 987/987 co-relation queries the response was YES. [2024-06-04 16:31:07,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 320 events. 173/320 cut-off events. For 987/987 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1135 event pairs, 44 based on Foata normal form. 1/319 useless extension candidates. Maximal degree in co-relation 1072. Up to 294 conditions per place. [2024-06-04 16:31:07,526 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-04 16:31:07,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 277 flow [2024-06-04 16:31:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 16:31:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 16:31:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-04 16:31:07,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:31:07,527 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 161 flow. Second operand 6 states and 78 transitions. [2024-06-04 16:31:07,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 277 flow [2024-06-04 16:31:07,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 260 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:31:07,530 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 177 flow [2024-06-04 16:31:07,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-06-04 16:31:07,531 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-04 16:31:07,531 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 177 flow [2024-06-04 16:31:07,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 16:31:07,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:07,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:07,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 16:31:07,532 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:07,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:07,533 INFO L85 PathProgramCache]: Analyzing trace with hash 595932692, now seen corresponding path program 2 times [2024-06-04 16:31:07,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:07,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349229132] [2024-06-04 16:31:07,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:07,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:12,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349229132] [2024-06-04 16:31:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349229132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:12,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:12,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:31:12,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679796480] [2024-06-04 16:31:12,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:12,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:31:12,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:12,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:31:12,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:31:12,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:12,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 16:31:12,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:12,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:12,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:13,014 INFO L124 PetriNetUnfolderBase]: 171/318 cut-off events. [2024-06-04 16:31:13,015 INFO L125 PetriNetUnfolderBase]: For 1231/1231 co-relation queries the response was YES. [2024-06-04 16:31:13,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 318 events. 171/318 cut-off events. For 1231/1231 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1147 event pairs, 45 based on Foata normal form. 1/316 useless extension candidates. Maximal degree in co-relation 1120. Up to 285 conditions per place. [2024-06-04 16:31:13,017 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 31 selfloop transitions, 13 changer transitions 0/47 dead transitions. [2024-06-04 16:31:13,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 307 flow [2024-06-04 16:31:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2024-06-04 16:31:13,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38392857142857145 [2024-06-04 16:31:13,019 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 177 flow. Second operand 7 states and 86 transitions. [2024-06-04 16:31:13,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 307 flow [2024-06-04 16:31:13,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 286 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 16:31:13,021 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 220 flow [2024-06-04 16:31:13,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-06-04 16:31:13,022 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-06-04 16:31:13,022 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 220 flow [2024-06-04 16:31:13,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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) [2024-06-04 16:31:13,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:13,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 16:31:13,023 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:13,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:13,024 INFO L85 PathProgramCache]: Analyzing trace with hash -103213844, now seen corresponding path program 1 times [2024-06-04 16:31:13,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213885264] [2024-06-04 16:31:13,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:13,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:18,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213885264] [2024-06-04 16:31:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213885264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005771172] [2024-06-04 16:31:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:18,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:18,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:18,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:18,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:18,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:18,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:19,014 INFO L124 PetriNetUnfolderBase]: 186/345 cut-off events. [2024-06-04 16:31:19,015 INFO L125 PetriNetUnfolderBase]: For 1550/1550 co-relation queries the response was YES. [2024-06-04 16:31:19,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 345 events. 186/345 cut-off events. For 1550/1550 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1258 event pairs, 44 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1292. Up to 299 conditions per place. [2024-06-04 16:31:19,017 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 42 selfloop transitions, 17 changer transitions 0/62 dead transitions. [2024-06-04 16:31:19,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 425 flow [2024-06-04 16:31:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:31:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:31:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-04 16:31:19,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3984375 [2024-06-04 16:31:19,019 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 220 flow. Second operand 8 states and 102 transitions. [2024-06-04 16:31:19,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 425 flow [2024-06-04 16:31:19,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 399 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:19,025 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 312 flow [2024-06-04 16:31:19,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=312, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-06-04 16:31:19,027 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-04 16:31:19,028 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 312 flow [2024-06-04 16:31:19,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:19,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:19,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:19,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 16:31:19,029 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:19,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1087242412, now seen corresponding path program 2 times [2024-06-04 16:31:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591639932] [2024-06-04 16:31:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:24,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:24,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591639932] [2024-06-04 16:31:24,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591639932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:24,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:24,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:24,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641838543] [2024-06-04 16:31:24,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:24,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:24,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:24,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:24,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:24,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:24,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:24,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:24,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:25,234 INFO L124 PetriNetUnfolderBase]: 192/357 cut-off events. [2024-06-04 16:31:25,234 INFO L125 PetriNetUnfolderBase]: For 2026/2026 co-relation queries the response was YES. [2024-06-04 16:31:25,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 357 events. 192/357 cut-off events. For 2026/2026 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1326 event pairs, 43 based on Foata normal form. 2/357 useless extension candidates. Maximal degree in co-relation 1435. Up to 299 conditions per place. [2024-06-04 16:31:25,238 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2024-06-04 16:31:25,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 480 flow [2024-06-04 16:31:25,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:25,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-04 16:31:25,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-04 16:31:25,241 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 312 flow. Second operand 7 states and 92 transitions. [2024-06-04 16:31:25,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 480 flow [2024-06-04 16:31:25,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 64 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:25,245 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 350 flow [2024-06-04 16:31:25,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=350, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-06-04 16:31:25,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 32 predicate places. [2024-06-04 16:31:25,246 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 350 flow [2024-06-04 16:31:25,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:25,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:25,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:25,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 16:31:25,247 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:25,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1153185446, now seen corresponding path program 3 times [2024-06-04 16:31:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:25,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032910092] [2024-06-04 16:31:25,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:25,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:30,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:30,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032910092] [2024-06-04 16:31:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032910092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:30,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:30,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:30,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955287787] [2024-06-04 16:31:30,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:30,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:30,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:30,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 350 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:30,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:30,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:30,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:31,314 INFO L124 PetriNetUnfolderBase]: 195/362 cut-off events. [2024-06-04 16:31:31,314 INFO L125 PetriNetUnfolderBase]: For 2459/2459 co-relation queries the response was YES. [2024-06-04 16:31:31,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 362 events. 195/362 cut-off events. For 2459/2459 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1345 event pairs, 45 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 1540. Up to 301 conditions per place. [2024-06-04 16:31:31,318 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 42 selfloop transitions, 20 changer transitions 0/65 dead transitions. [2024-06-04 16:31:31,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 531 flow [2024-06-04 16:31:31,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 16:31:31,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017857142857143 [2024-06-04 16:31:31,320 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 350 flow. Second operand 7 states and 90 transitions. [2024-06-04 16:31:31,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 531 flow [2024-06-04 16:31:31,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 486 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:31,325 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 404 flow [2024-06-04 16:31:31,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-06-04 16:31:31,327 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 35 predicate places. [2024-06-04 16:31:31,327 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 404 flow [2024-06-04 16:31:31,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:31,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:31,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:31,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 16:31:31,328 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:31,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:31,328 INFO L85 PathProgramCache]: Analyzing trace with hash 75391297, now seen corresponding path program 1 times [2024-06-04 16:31:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:31,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92050217] [2024-06-04 16:31:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:31,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:37,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:37,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92050217] [2024-06-04 16:31:37,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92050217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:37,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:37,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:37,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202735526] [2024-06-04 16:31:37,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:37,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:37,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:37,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:37,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:37,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:37,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 404 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:37,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:37,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:37,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:38,144 INFO L124 PetriNetUnfolderBase]: 198/367 cut-off events. [2024-06-04 16:31:38,145 INFO L125 PetriNetUnfolderBase]: For 2889/2889 co-relation queries the response was YES. [2024-06-04 16:31:38,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 367 events. 198/367 cut-off events. For 2889/2889 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1364 event pairs, 42 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1628. Up to 330 conditions per place. [2024-06-04 16:31:38,148 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2024-06-04 16:31:38,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 562 flow [2024-06-04 16:31:38,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 88 transitions. [2024-06-04 16:31:38,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39285714285714285 [2024-06-04 16:31:38,150 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 404 flow. Second operand 7 states and 88 transitions. [2024-06-04 16:31:38,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 562 flow [2024-06-04 16:31:38,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 532 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:38,155 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 419 flow [2024-06-04 16:31:38,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=419, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2024-06-04 16:31:38,156 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-04 16:31:38,156 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 419 flow [2024-06-04 16:31:38,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:38,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:38,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:38,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 16:31:38,157 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:38,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:38,157 INFO L85 PathProgramCache]: Analyzing trace with hash 80955270, now seen corresponding path program 4 times [2024-06-04 16:31:38,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:38,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703374256] [2024-06-04 16:31:38,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:38,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703374256] [2024-06-04 16:31:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703374256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965250969] [2024-06-04 16:31:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:44,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:44,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:44,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 419 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:44,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:44,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:44,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:44,777 INFO L124 PetriNetUnfolderBase]: 204/382 cut-off events. [2024-06-04 16:31:44,777 INFO L125 PetriNetUnfolderBase]: For 3396/3396 co-relation queries the response was YES. [2024-06-04 16:31:44,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 382 events. 204/382 cut-off events. For 3396/3396 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1475 event pairs, 50 based on Foata normal form. 2/379 useless extension candidates. Maximal degree in co-relation 1758. Up to 295 conditions per place. [2024-06-04 16:31:44,780 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 43 selfloop transitions, 25 changer transitions 0/71 dead transitions. [2024-06-04 16:31:44,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 645 flow [2024-06-04 16:31:44,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-04 16:31:44,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107142857142857 [2024-06-04 16:31:44,781 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 419 flow. Second operand 7 states and 92 transitions. [2024-06-04 16:31:44,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 645 flow [2024-06-04 16:31:44,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 616 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:44,785 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 489 flow [2024-06-04 16:31:44,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-06-04 16:31:44,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 41 predicate places. [2024-06-04 16:31:44,786 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 489 flow [2024-06-04 16:31:44,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:44,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:44,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:44,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 16:31:44,787 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:44,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:44,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1294045799, now seen corresponding path program 2 times [2024-06-04 16:31:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287005608] [2024-06-04 16:31:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:44,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287005608] [2024-06-04 16:31:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287005608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 16:31:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831449457] [2024-06-04 16:31:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:51,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 16:31:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 16:31:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 16:31:51,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:31:51,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 489 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:51,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:51,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:31:51,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:52,301 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-04 16:31:52,301 INFO L125 PetriNetUnfolderBase]: For 3890/3890 co-relation queries the response was YES. [2024-06-04 16:31:52,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 387 events. 207/387 cut-off events. For 3890/3890 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1488 event pairs, 45 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1867. Up to 339 conditions per place. [2024-06-04 16:31:52,304 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 52 selfloop transitions, 16 changer transitions 0/71 dead transitions. [2024-06-04 16:31:52,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 653 flow [2024-06-04 16:31:52,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 16:31:52,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2024-06-04 16:31:52,305 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 489 flow. Second operand 7 states and 87 transitions. [2024-06-04 16:31:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 653 flow [2024-06-04 16:31:52,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 624 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 16:31:52,312 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 515 flow [2024-06-04 16:31:52,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=515, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-06-04 16:31:52,313 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 45 predicate places. [2024-06-04 16:31:52,313 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 515 flow [2024-06-04 16:31:52,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) [2024-06-04 16:31:52,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:52,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:52,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 16:31:52,314 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:52,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:52,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1294312709, now seen corresponding path program 3 times [2024-06-04 16:31:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641113854] [2024-06-04 16:31:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:52,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:31:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:31:58,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:31:58,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641113854] [2024-06-04 16:31:58,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641113854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:31:58,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:31:58,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:31:58,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377667991] [2024-06-04 16:31:58,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:31:58,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:31:58,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:31:58,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:31:58,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:31:58,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:31:58,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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) [2024-06-04 16:31:58,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:31:58,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:31:58,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:31:59,050 INFO L124 PetriNetUnfolderBase]: 205/384 cut-off events. [2024-06-04 16:31:59,050 INFO L125 PetriNetUnfolderBase]: For 4158/4158 co-relation queries the response was YES. [2024-06-04 16:31:59,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 384 events. 205/384 cut-off events. For 4158/4158 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1472 event pairs, 45 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 1911. Up to 327 conditions per place. [2024-06-04 16:31:59,054 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 51 selfloop transitions, 21 changer transitions 0/75 dead transitions. [2024-06-04 16:31:59,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 701 flow [2024-06-04 16:31:59,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:31:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:31:59,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-04 16:31:59,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42410714285714285 [2024-06-04 16:31:59,055 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 515 flow. Second operand 7 states and 95 transitions. [2024-06-04 16:31:59,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 701 flow [2024-06-04 16:31:59,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 662 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 16:31:59,063 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 566 flow [2024-06-04 16:31:59,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-04 16:31:59,064 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 48 predicate places. [2024-06-04 16:31:59,064 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 566 flow [2024-06-04 16:31:59,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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) [2024-06-04 16:31:59,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:31:59,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:31:59,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 16:31:59,065 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:31:59,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:31:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1294322629, now seen corresponding path program 1 times [2024-06-04 16:31:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:31:59,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578716261] [2024-06-04 16:31:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:31:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:31:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578716261] [2024-06-04 16:32:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578716261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 16:32:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697346028] [2024-06-04 16:32:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:07,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 16:32:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 16:32:07,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 16:32:07,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2024-06-04 16:32:07,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 566 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2024-06-04 16:32:07,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:07,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2024-06-04 16:32:07,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:07,850 INFO L124 PetriNetUnfolderBase]: 188/363 cut-off events. [2024-06-04 16:32:07,851 INFO L125 PetriNetUnfolderBase]: For 4468/4472 co-relation queries the response was YES. [2024-06-04 16:32:07,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 363 events. 188/363 cut-off events. For 4468/4472 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1429 event pairs, 42 based on Foata normal form. 5/365 useless extension candidates. Maximal degree in co-relation 1844. Up to 309 conditions per place. [2024-06-04 16:32:07,854 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 55 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2024-06-04 16:32:07,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 78 transitions, 724 flow [2024-06-04 16:32:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 16:32:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 16:32:07,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2024-06-04 16:32:07,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45089285714285715 [2024-06-04 16:32:07,856 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 566 flow. Second operand 7 states and 101 transitions. [2024-06-04 16:32:07,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 78 transitions, 724 flow [2024-06-04 16:32:07,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 78 transitions, 693 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 16:32:07,863 INFO L231 Difference]: Finished difference. Result has 83 places, 71 transitions, 576 flow [2024-06-04 16:32:07,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=576, PETRI_PLACES=83, PETRI_TRANSITIONS=71} [2024-06-04 16:32:07,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 52 predicate places. [2024-06-04 16:32:07,864 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 71 transitions, 576 flow [2024-06-04 16:32:07,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2024-06-04 16:32:07,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:07,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:07,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 16:32:07,865 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:07,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1962604071, now seen corresponding path program 1 times [2024-06-04 16:32:07,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:07,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386587399] [2024-06-04 16:32:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:07,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:14,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:14,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386587399] [2024-06-04 16:32:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386587399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:14,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:14,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:14,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260590848] [2024-06-04 16:32:14,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:14,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:15,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:32:15,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 71 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:15,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:15,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:32:15,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:15,457 INFO L124 PetriNetUnfolderBase]: 201/377 cut-off events. [2024-06-04 16:32:15,457 INFO L125 PetriNetUnfolderBase]: For 4767/4767 co-relation queries the response was YES. [2024-06-04 16:32:15,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 377 events. 201/377 cut-off events. For 4767/4767 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1446 event pairs, 40 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 1985. Up to 310 conditions per place. [2024-06-04 16:32:15,460 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 65 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-04 16:32:15,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 87 transitions, 808 flow [2024-06-04 16:32:15,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 16:32:15,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:32:15,462 INFO L175 Difference]: Start difference. First operand has 83 places, 71 transitions, 576 flow. Second operand 8 states and 104 transitions. [2024-06-04 16:32:15,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 87 transitions, 808 flow [2024-06-04 16:32:15,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 761 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:15,470 INFO L231 Difference]: Finished difference. Result has 85 places, 73 transitions, 600 flow [2024-06-04 16:32:15,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=600, PETRI_PLACES=85, PETRI_TRANSITIONS=73} [2024-06-04 16:32:15,470 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-04 16:32:15,470 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 73 transitions, 600 flow [2024-06-04 16:32:15,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:15,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:15,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:15,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 16:32:15,471 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:15,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:15,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1962483915, now seen corresponding path program 1 times [2024-06-04 16:32:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716458527] [2024-06-04 16:32:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:22,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:22,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716458527] [2024-06-04 16:32:22,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716458527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:22,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:22,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:22,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637963622] [2024-06-04 16:32:22,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:22,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:22,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:22,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:22,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:22,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:22,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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) [2024-06-04 16:32:22,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:22,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:22,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:23,297 INFO L124 PetriNetUnfolderBase]: 207/387 cut-off events. [2024-06-04 16:32:23,297 INFO L125 PetriNetUnfolderBase]: For 5498/5498 co-relation queries the response was YES. [2024-06-04 16:32:23,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 387 events. 207/387 cut-off events. For 5498/5498 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1491 event pairs, 39 based on Foata normal form. 2/387 useless extension candidates. Maximal degree in co-relation 2083. Up to 317 conditions per place. [2024-06-04 16:32:23,300 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2024-06-04 16:32:23,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 87 transitions, 822 flow [2024-06-04 16:32:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:23,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 16:32:23,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37109375 [2024-06-04 16:32:23,304 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 600 flow. Second operand 8 states and 95 transitions. [2024-06-04 16:32:23,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 87 transitions, 822 flow [2024-06-04 16:32:23,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 87 transitions, 767 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:23,311 INFO L231 Difference]: Finished difference. Result has 87 places, 76 transitions, 629 flow [2024-06-04 16:32:23,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=629, PETRI_PLACES=87, PETRI_TRANSITIONS=76} [2024-06-04 16:32:23,312 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-04 16:32:23,312 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 76 transitions, 629 flow [2024-06-04 16:32:23,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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) [2024-06-04 16:32:23,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:23,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 16:32:23,313 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:23,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1957842285, now seen corresponding path program 2 times [2024-06-04 16:32:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:23,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163431635] [2024-06-04 16:32:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:29,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:29,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163431635] [2024-06-04 16:32:29,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163431635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:29,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:29,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:29,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85673597] [2024-06-04 16:32:29,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:29,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:29,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:29,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:29,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:29,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:32:29,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 76 transitions, 629 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:29,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:29,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:32:29,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:29,987 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-04 16:32:29,988 INFO L125 PetriNetUnfolderBase]: For 6189/6189 co-relation queries the response was YES. [2024-06-04 16:32:29,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2261 conditions, 399 events. 214/399 cut-off events. For 6189/6189 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1544 event pairs, 41 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 2218. Up to 318 conditions per place. [2024-06-04 16:32:29,992 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 24 changer transitions 0/89 dead transitions. [2024-06-04 16:32:29,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 895 flow [2024-06-04 16:32:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:29,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 16:32:29,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:32:29,994 INFO L175 Difference]: Start difference. First operand has 87 places, 76 transitions, 629 flow. Second operand 8 states and 104 transitions. [2024-06-04 16:32:29,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 895 flow [2024-06-04 16:32:30,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 89 transitions, 837 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:30,003 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 664 flow [2024-06-04 16:32:30,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2024-06-04 16:32:30,004 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-06-04 16:32:30,004 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 664 flow [2024-06-04 16:32:30,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:30,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:30,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:30,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 16:32:30,005 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:30,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1388414467, now seen corresponding path program 2 times [2024-06-04 16:32:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:30,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002295640] [2024-06-04 16:32:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:36,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:36,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002295640] [2024-06-04 16:32:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002295640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:36,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903421789] [2024-06-04 16:32:36,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:36,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:36,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:32:36,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:36,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:36,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:32:36,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:36,646 INFO L124 PetriNetUnfolderBase]: 211/394 cut-off events. [2024-06-04 16:32:36,646 INFO L125 PetriNetUnfolderBase]: For 6629/6629 co-relation queries the response was YES. [2024-06-04 16:32:36,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 394 events. 211/394 cut-off events. For 6629/6629 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1527 event pairs, 41 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 2232. Up to 321 conditions per place. [2024-06-04 16:32:36,649 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 63 selfloop transitions, 22 changer transitions 0/88 dead transitions. [2024-06-04 16:32:36,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 88 transitions, 856 flow [2024-06-04 16:32:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:36,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:32:36,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-04 16:32:36,651 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 664 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:32:36,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 88 transitions, 856 flow [2024-06-04 16:32:36,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 88 transitions, 761 flow, removed 20 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:36,658 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 618 flow [2024-06-04 16:32:36,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=618, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-06-04 16:32:36,658 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 60 predicate places. [2024-06-04 16:32:36,659 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 618 flow [2024-06-04 16:32:36,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:36,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:36,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:36,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 16:32:36,659 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:36,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -444048529, now seen corresponding path program 3 times [2024-06-04 16:32:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629961999] [2024-06-04 16:32:36,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:36,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:44,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:44,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629961999] [2024-06-04 16:32:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629961999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187633451] [2024-06-04 16:32:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:44,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:44,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:44,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:44,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:32:44,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 618 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:44,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:44,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:32:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:44,574 INFO L124 PetriNetUnfolderBase]: 214/399 cut-off events. [2024-06-04 16:32:44,575 INFO L125 PetriNetUnfolderBase]: For 7068/7068 co-relation queries the response was YES. [2024-06-04 16:32:44,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2279 conditions, 399 events. 214/399 cut-off events. For 7068/7068 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1544 event pairs, 41 based on Foata normal form. 1/398 useless extension candidates. Maximal degree in co-relation 2234. Up to 306 conditions per place. [2024-06-04 16:32:44,577 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 57 selfloop transitions, 30 changer transitions 0/90 dead transitions. [2024-06-04 16:32:44,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 90 transitions, 838 flow [2024-06-04 16:32:44,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 16:32:44,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-04 16:32:44,579 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 618 flow. Second operand 8 states and 103 transitions. [2024-06-04 16:32:44,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 90 transitions, 838 flow [2024-06-04 16:32:44,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 791 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:32:44,585 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 664 flow [2024-06-04 16:32:44,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=664, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2024-06-04 16:32:44,585 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 61 predicate places. [2024-06-04 16:32:44,586 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 664 flow [2024-06-04 16:32:44,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:44,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:44,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:44,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 16:32:44,586 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:44,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:44,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1388407523, now seen corresponding path program 1 times [2024-06-04 16:32:44,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:44,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898242093] [2024-06-04 16:32:44,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:44,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:51,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:51,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898242093] [2024-06-04 16:32:51,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898242093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:51,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:51,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:51,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593778614] [2024-06-04 16:32:51,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:51,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:51,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:51,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:51,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:52,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:32:52,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 664 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:52,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:52,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:32:52,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:52,341 INFO L124 PetriNetUnfolderBase]: 220/409 cut-off events. [2024-06-04 16:32:52,342 INFO L125 PetriNetUnfolderBase]: For 7982/7982 co-relation queries the response was YES. [2024-06-04 16:32:52,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2407 conditions, 409 events. 220/409 cut-off events. For 7982/7982 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1599 event pairs, 38 based on Foata normal form. 2/409 useless extension candidates. Maximal degree in co-relation 2361. Up to 362 conditions per place. [2024-06-04 16:32:52,345 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2024-06-04 16:32:52,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 888 flow [2024-06-04 16:32:52,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 16:32:52,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38671875 [2024-06-04 16:32:52,348 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 664 flow. Second operand 8 states and 99 transitions. [2024-06-04 16:32:52,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 888 flow [2024-06-04 16:32:52,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 93 transitions, 811 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:52,355 INFO L231 Difference]: Finished difference. Result has 94 places, 83 transitions, 644 flow [2024-06-04 16:32:52,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=644, PETRI_PLACES=94, PETRI_TRANSITIONS=83} [2024-06-04 16:32:52,355 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 63 predicate places. [2024-06-04 16:32:52,356 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 83 transitions, 644 flow [2024-06-04 16:32:52,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:32:52,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:52,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:52,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 16:32:52,356 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:52,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1460708909, now seen corresponding path program 4 times [2024-06-04 16:32:52,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:52,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947871337] [2024-06-04 16:32:52,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:52,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:32:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:32:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:32:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947871337] [2024-06-04 16:32:58,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947871337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:32:58,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:32:58,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:32:58,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892944981] [2024-06-04 16:32:58,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:32:58,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:32:58,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:32:58,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:32:58,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:32:58,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:32:58,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 83 transitions, 644 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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) [2024-06-04 16:32:58,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:32:58,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:32:58,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:32:58,993 INFO L124 PetriNetUnfolderBase]: 226/420 cut-off events. [2024-06-04 16:32:58,993 INFO L125 PetriNetUnfolderBase]: For 8641/8641 co-relation queries the response was YES. [2024-06-04 16:32:58,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2485 conditions, 420 events. 226/420 cut-off events. For 8641/8641 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1668 event pairs, 46 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 2438. Up to 328 conditions per place. [2024-06-04 16:32:58,996 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 63 selfloop transitions, 28 changer transitions 0/94 dead transitions. [2024-06-04 16:32:58,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 94 transitions, 898 flow [2024-06-04 16:32:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:32:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:32:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 16:32:58,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2024-06-04 16:32:58,998 INFO L175 Difference]: Start difference. First operand has 94 places, 83 transitions, 644 flow. Second operand 8 states and 94 transitions. [2024-06-04 16:32:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 94 transitions, 898 flow [2024-06-04 16:32:59,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 94 transitions, 857 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 16:32:59,006 INFO L231 Difference]: Finished difference. Result has 96 places, 86 transitions, 713 flow [2024-06-04 16:32:59,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=713, PETRI_PLACES=96, PETRI_TRANSITIONS=86} [2024-06-04 16:32:59,007 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 65 predicate places. [2024-06-04 16:32:59,007 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 86 transitions, 713 flow [2024-06-04 16:32:59,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 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) [2024-06-04 16:32:59,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:32:59,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:32:59,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 16:32:59,008 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:32:59,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:32:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1460715419, now seen corresponding path program 5 times [2024-06-04 16:32:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:32:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521444988] [2024-06-04 16:32:59,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:32:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:32:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:06,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:06,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:06,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521444988] [2024-06-04 16:33:06,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521444988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:06,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:06,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:06,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66972018] [2024-06-04 16:33:06,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:06,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:06,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:06,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:06,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:06,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:06,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 86 transitions, 713 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:06,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:06,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:06,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:07,126 INFO L124 PetriNetUnfolderBase]: 229/425 cut-off events. [2024-06-04 16:33:07,126 INFO L125 PetriNetUnfolderBase]: For 9296/9296 co-relation queries the response was YES. [2024-06-04 16:33:07,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2608 conditions, 425 events. 229/425 cut-off events. For 9296/9296 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1700 event pairs, 46 based on Foata normal form. 1/421 useless extension candidates. Maximal degree in co-relation 2560. Up to 327 conditions per place. [2024-06-04 16:33:07,129 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 62 selfloop transitions, 31 changer transitions 0/96 dead transitions. [2024-06-04 16:33:07,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 96 transitions, 963 flow [2024-06-04 16:33:07,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-04 16:33:07,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:33:07,130 INFO L175 Difference]: Start difference. First operand has 96 places, 86 transitions, 713 flow. Second operand 8 states and 104 transitions. [2024-06-04 16:33:07,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 96 transitions, 963 flow [2024-06-04 16:33:07,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 96 transitions, 875 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:07,141 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 728 flow [2024-06-04 16:33:07,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-06-04 16:33:07,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 67 predicate places. [2024-06-04 16:33:07,142 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 728 flow [2024-06-04 16:33:07,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:07,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:07,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:07,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 16:33:07,143 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:07,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1785345637, now seen corresponding path program 2 times [2024-06-04 16:33:07,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:07,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135760805] [2024-06-04 16:33:07,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:07,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:15,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135760805] [2024-06-04 16:33:15,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135760805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:15,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:15,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:15,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525735162] [2024-06-04 16:33:15,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:15,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:15,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:15,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:15,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:15,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:15,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:15,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:15,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:15,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:16,115 INFO L124 PetriNetUnfolderBase]: 232/430 cut-off events. [2024-06-04 16:33:16,116 INFO L125 PetriNetUnfolderBase]: For 10016/10016 co-relation queries the response was YES. [2024-06-04 16:33:16,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2658 conditions, 430 events. 232/430 cut-off events. For 10016/10016 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1715 event pairs, 41 based on Foata normal form. 1/427 useless extension candidates. Maximal degree in co-relation 2609. Up to 379 conditions per place. [2024-06-04 16:33:16,120 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 76 selfloop transitions, 18 changer transitions 0/97 dead transitions. [2024-06-04 16:33:16,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 97 transitions, 952 flow [2024-06-04 16:33:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:33:16,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-04 16:33:16,122 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 728 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:33:16,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 97 transitions, 952 flow [2024-06-04 16:33:16,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 865 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:16,134 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 706 flow [2024-06-04 16:33:16,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2024-06-04 16:33:16,135 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 69 predicate places. [2024-06-04 16:33:16,135 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 706 flow [2024-06-04 16:33:16,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:16,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:16,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 16:33:16,136 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:16,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1785115245, now seen corresponding path program 6 times [2024-06-04 16:33:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:16,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931563849] [2024-06-04 16:33:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:23,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931563849] [2024-06-04 16:33:23,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931563849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:23,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:23,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:23,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776309666] [2024-06-04 16:33:23,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:23,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:23,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:23,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:23,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:23,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:23,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 706 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:23,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:23,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:23,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:23,508 INFO L124 PetriNetUnfolderBase]: 230/427 cut-off events. [2024-06-04 16:33:23,509 INFO L125 PetriNetUnfolderBase]: For 10193/10193 co-relation queries the response was YES. [2024-06-04 16:33:23,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2613 conditions, 427 events. 230/427 cut-off events. For 10193/10193 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1703 event pairs, 45 based on Foata normal form. 1/423 useless extension candidates. Maximal degree in co-relation 2563. Up to 300 conditions per place. [2024-06-04 16:33:23,512 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 53 selfloop transitions, 44 changer transitions 0/100 dead transitions. [2024-06-04 16:33:23,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 100 transitions, 970 flow [2024-06-04 16:33:23,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 16:33:23,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40234375 [2024-06-04 16:33:23,513 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 706 flow. Second operand 8 states and 103 transitions. [2024-06-04 16:33:23,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 100 transitions, 970 flow [2024-06-04 16:33:23,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 100 transitions, 921 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:23,525 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 790 flow [2024-06-04 16:33:23,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=790, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2024-06-04 16:33:23,526 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 71 predicate places. [2024-06-04 16:33:23,526 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 790 flow [2024-06-04 16:33:23,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:23,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:23,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:23,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 16:33:23,526 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:23,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:23,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1785114997, now seen corresponding path program 3 times [2024-06-04 16:33:23,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:23,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427533258] [2024-06-04 16:33:23,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:23,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:30,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:30,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427533258] [2024-06-04 16:33:30,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427533258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:30,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:30,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770184103] [2024-06-04 16:33:30,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:30,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:30,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:30,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:30,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:30,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:30,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:30,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:30,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:30,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:30,994 INFO L124 PetriNetUnfolderBase]: 233/432 cut-off events. [2024-06-04 16:33:30,994 INFO L125 PetriNetUnfolderBase]: For 10958/10958 co-relation queries the response was YES. [2024-06-04 16:33:30,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 432 events. 233/432 cut-off events. For 10958/10958 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1721 event pairs, 40 based on Foata normal form. 1/429 useless extension candidates. Maximal degree in co-relation 2696. Up to 359 conditions per place. [2024-06-04 16:33:30,999 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 75 selfloop transitions, 28 changer transitions 0/106 dead transitions. [2024-06-04 16:33:30,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 1126 flow [2024-06-04 16:33:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 16:33:31,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39453125 [2024-06-04 16:33:31,002 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 790 flow. Second operand 8 states and 101 transitions. [2024-06-04 16:33:31,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 1126 flow [2024-06-04 16:33:31,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 106 transitions, 1009 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:31,013 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 810 flow [2024-06-04 16:33:31,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=810, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2024-06-04 16:33:31,013 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 74 predicate places. [2024-06-04 16:33:31,014 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 810 flow [2024-06-04 16:33:31,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:31,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:31,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:31,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 16:33:31,014 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:31,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:31,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1469286547, now seen corresponding path program 4 times [2024-06-04 16:33:31,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:31,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137706668] [2024-06-04 16:33:31,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:31,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:37,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:37,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137706668] [2024-06-04 16:33:37,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137706668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:37,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:37,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 16:33:37,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529095506] [2024-06-04 16:33:37,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:37,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 16:33:37,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:37,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 16:33:37,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 16:33:37,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:37,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 810 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:37,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:37,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:37,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:38,148 INFO L124 PetriNetUnfolderBase]: 234/433 cut-off events. [2024-06-04 16:33:38,149 INFO L125 PetriNetUnfolderBase]: For 11593/11593 co-relation queries the response was YES. [2024-06-04 16:33:38,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 433 events. 234/433 cut-off events. For 11593/11593 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1706 event pairs, 40 based on Foata normal form. 2/433 useless extension candidates. Maximal degree in co-relation 2682. Up to 391 conditions per place. [2024-06-04 16:33:38,152 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 90 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2024-06-04 16:33:38,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 107 transitions, 1060 flow [2024-06-04 16:33:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 16:33:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 16:33:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 16:33:38,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37890625 [2024-06-04 16:33:38,154 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 810 flow. Second operand 8 states and 97 transitions. [2024-06-04 16:33:38,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 107 transitions, 1060 flow [2024-06-04 16:33:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 1005 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-04 16:33:38,166 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 820 flow [2024-06-04 16:33:38,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=820, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2024-06-04 16:33:38,167 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 79 predicate places. [2024-06-04 16:33:38,167 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 820 flow [2024-06-04 16:33:38,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 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) [2024-06-04 16:33:38,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:38,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:38,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 16:33:38,168 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:38,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1469297459, now seen corresponding path program 1 times [2024-06-04 16:33:38,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:38,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016643179] [2024-06-04 16:33:38,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:38,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016643179] [2024-06-04 16:33:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016643179] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115341142] [2024-06-04 16:33:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:46,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:46,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:46,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:33:46,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 820 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-04 16:33:46,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:46,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:33:46,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:47,061 INFO L124 PetriNetUnfolderBase]: 218/413 cut-off events. [2024-06-04 16:33:47,061 INFO L125 PetriNetUnfolderBase]: For 11452/11456 co-relation queries the response was YES. [2024-06-04 16:33:47,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 413 events. 218/413 cut-off events. For 11452/11456 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1662 event pairs, 37 based on Foata normal form. 6/416 useless extension candidates. Maximal degree in co-relation 2535. Up to 339 conditions per place. [2024-06-04 16:33:47,064 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 78 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2024-06-04 16:33:47,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 109 transitions, 1022 flow [2024-06-04 16:33:47,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:33:47,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 16:33:47,066 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 820 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:33:47,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 109 transitions, 1022 flow [2024-06-04 16:33:47,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 109 transitions, 977 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-04 16:33:47,082 INFO L231 Difference]: Finished difference. Result has 113 places, 100 transitions, 805 flow [2024-06-04 16:33:47,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=805, PETRI_PLACES=113, PETRI_TRANSITIONS=100} [2024-06-04 16:33:47,083 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 82 predicate places. [2024-06-04 16:33:47,083 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 100 transitions, 805 flow [2024-06-04 16:33:47,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 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) [2024-06-04 16:33:47,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:47,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:47,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 16:33:47,084 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:47,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -711182526, now seen corresponding path program 1 times [2024-06-04 16:33:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144955484] [2024-06-04 16:33:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:33:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:33:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:33:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144955484] [2024-06-04 16:33:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144955484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:33:55,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:33:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:33:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039722249] [2024-06-04 16:33:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:33:55,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:33:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:33:55,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:33:55,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:33:55,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:33:55,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 100 transitions, 805 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:33:55,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:33:55,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:33:55,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:33:56,062 INFO L124 PetriNetUnfolderBase]: 234/435 cut-off events. [2024-06-04 16:33:56,063 INFO L125 PetriNetUnfolderBase]: For 11697/11697 co-relation queries the response was YES. [2024-06-04 16:33:56,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2755 conditions, 435 events. 234/435 cut-off events. For 11697/11697 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1728 event pairs, 35 based on Foata normal form. 1/434 useless extension candidates. Maximal degree in co-relation 2699. Up to 363 conditions per place. [2024-06-04 16:33:56,067 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 93 selfloop transitions, 21 changer transitions 0/117 dead transitions. [2024-06-04 16:33:56,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1111 flow [2024-06-04 16:33:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:33:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:33:56,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:33:56,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:33:56,069 INFO L175 Difference]: Start difference. First operand has 113 places, 100 transitions, 805 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:33:56,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1111 flow [2024-06-04 16:33:56,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 117 transitions, 1079 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 16:33:56,081 INFO L231 Difference]: Finished difference. Result has 115 places, 102 transitions, 860 flow [2024-06-04 16:33:56,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=860, PETRI_PLACES=115, PETRI_TRANSITIONS=102} [2024-06-04 16:33:56,082 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-06-04 16:33:56,082 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 102 transitions, 860 flow [2024-06-04 16:33:56,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:33:56,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:33:56,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:33:56,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 16:33:56,083 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:33:56,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:33:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -707457659, now seen corresponding path program 1 times [2024-06-04 16:33:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:33:56,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122545457] [2024-06-04 16:33:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:33:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:33:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:04,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122545457] [2024-06-04 16:34:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122545457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:04,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:04,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:04,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799364355] [2024-06-04 16:34:04,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:04,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:04,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:04,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:04,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:04,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 102 transitions, 860 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:04,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:04,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:04,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:05,077 INFO L124 PetriNetUnfolderBase]: 240/445 cut-off events. [2024-06-04 16:34:05,077 INFO L125 PetriNetUnfolderBase]: For 13118/13118 co-relation queries the response was YES. [2024-06-04 16:34:05,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 445 events. 240/445 cut-off events. For 13118/13118 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1788 event pairs, 34 based on Foata normal form. 2/445 useless extension candidates. Maximal degree in co-relation 2827. Up to 367 conditions per place. [2024-06-04 16:34:05,080 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 89 selfloop transitions, 25 changer transitions 0/117 dead transitions. [2024-06-04 16:34:05,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 117 transitions, 1164 flow [2024-06-04 16:34:05,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:05,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:34:05,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:34:05,081 INFO L175 Difference]: Start difference. First operand has 115 places, 102 transitions, 860 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:34:05,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 117 transitions, 1164 flow [2024-06-04 16:34:05,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 117 transitions, 1093 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:05,099 INFO L231 Difference]: Finished difference. Result has 117 places, 105 transitions, 897 flow [2024-06-04 16:34:05,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=117, PETRI_TRANSITIONS=105} [2024-06-04 16:34:05,099 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-06-04 16:34:05,099 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 105 transitions, 897 flow [2024-06-04 16:34:05,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:05,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:05,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:05,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 16:34:05,100 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:05,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:05,101 INFO L85 PathProgramCache]: Analyzing trace with hash -96530786, now seen corresponding path program 2 times [2024-06-04 16:34:05,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:05,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446076362] [2024-06-04 16:34:05,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:05,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:14,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:14,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:14,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446076362] [2024-06-04 16:34:14,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446076362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:14,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:14,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:14,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84227936] [2024-06-04 16:34:14,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:14,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:14,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:14,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:14,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:15,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:15,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 105 transitions, 897 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:15,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:15,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:15,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:15,436 INFO L124 PetriNetUnfolderBase]: 243/452 cut-off events. [2024-06-04 16:34:15,436 INFO L125 PetriNetUnfolderBase]: For 13758/13758 co-relation queries the response was YES. [2024-06-04 16:34:15,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 452 events. 243/452 cut-off events. For 13758/13758 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1834 event pairs, 34 based on Foata normal form. 1/451 useless extension candidates. Maximal degree in co-relation 2929. Up to 375 conditions per place. [2024-06-04 16:34:15,439 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 92 selfloop transitions, 24 changer transitions 0/119 dead transitions. [2024-06-04 16:34:15,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 119 transitions, 1201 flow [2024-06-04 16:34:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:15,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:34:15,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 16:34:15,440 INFO L175 Difference]: Start difference. First operand has 117 places, 105 transitions, 897 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:34:15,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 119 transitions, 1201 flow [2024-06-04 16:34:15,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 119 transitions, 1115 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:15,454 INFO L231 Difference]: Finished difference. Result has 119 places, 107 transitions, 910 flow [2024-06-04 16:34:15,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=119, PETRI_TRANSITIONS=107} [2024-06-04 16:34:15,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 88 predicate places. [2024-06-04 16:34:15,455 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 107 transitions, 910 flow [2024-06-04 16:34:15,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:15,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:15,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:15,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 16:34:15,455 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:15,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:15,456 INFO L85 PathProgramCache]: Analyzing trace with hash -90958939, now seen corresponding path program 2 times [2024-06-04 16:34:15,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:15,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134728470] [2024-06-04 16:34:15,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:15,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:15,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:23,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:23,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134728470] [2024-06-04 16:34:23,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134728470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:23,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:23,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:23,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645995758] [2024-06-04 16:34:23,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:23,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:23,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:23,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:23,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:23,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:23,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 107 transitions, 910 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:23,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:23,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:23,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:23,647 INFO L124 PetriNetUnfolderBase]: 269/494 cut-off events. [2024-06-04 16:34:23,647 INFO L125 PetriNetUnfolderBase]: For 17965/17965 co-relation queries the response was YES. [2024-06-04 16:34:23,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3426 conditions, 494 events. 269/494 cut-off events. For 17965/17965 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2031 event pairs, 34 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 3367. Up to 353 conditions per place. [2024-06-04 16:34:23,652 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 83 selfloop transitions, 39 changer transitions 0/125 dead transitions. [2024-06-04 16:34:23,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 1348 flow [2024-06-04 16:34:23,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:23,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:23,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 16:34:23,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 16:34:23,654 INFO L175 Difference]: Start difference. First operand has 119 places, 107 transitions, 910 flow. Second operand 9 states and 118 transitions. [2024-06-04 16:34:23,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 1348 flow [2024-06-04 16:34:23,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 1265 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-04 16:34:23,675 INFO L231 Difference]: Finished difference. Result has 122 places, 112 transitions, 1011 flow [2024-06-04 16:34:23,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1011, PETRI_PLACES=122, PETRI_TRANSITIONS=112} [2024-06-04 16:34:23,675 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 91 predicate places. [2024-06-04 16:34:23,675 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 112 transitions, 1011 flow [2024-06-04 16:34:23,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:23,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:23,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:23,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 16:34:23,676 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:23,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -90966379, now seen corresponding path program 3 times [2024-06-04 16:34:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355214035] [2024-06-04 16:34:23,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:32,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355214035] [2024-06-04 16:34:32,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355214035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:32,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:32,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:32,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524091347] [2024-06-04 16:34:32,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:32,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:32,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:32,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:32,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:32,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:32,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 112 transitions, 1011 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:32,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:32,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:32,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:33,002 INFO L124 PetriNetUnfolderBase]: 272/499 cut-off events. [2024-06-04 16:34:33,003 INFO L125 PetriNetUnfolderBase]: For 18624/18624 co-relation queries the response was YES. [2024-06-04 16:34:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 499 events. 272/499 cut-off events. For 18624/18624 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2058 event pairs, 36 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 3523. Up to 379 conditions per place. [2024-06-04 16:34:33,007 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 88 selfloop transitions, 39 changer transitions 0/130 dead transitions. [2024-06-04 16:34:33,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 1489 flow [2024-06-04 16:34:33,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:33,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:33,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 16:34:33,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 16:34:33,009 INFO L175 Difference]: Start difference. First operand has 122 places, 112 transitions, 1011 flow. Second operand 9 states and 116 transitions. [2024-06-04 16:34:33,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 1489 flow [2024-06-04 16:34:33,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 130 transitions, 1381 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-04 16:34:33,034 INFO L231 Difference]: Finished difference. Result has 127 places, 119 transitions, 1149 flow [2024-06-04 16:34:33,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1149, PETRI_PLACES=127, PETRI_TRANSITIONS=119} [2024-06-04 16:34:33,035 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-06-04 16:34:33,035 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 119 transitions, 1149 flow [2024-06-04 16:34:33,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:33,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:33,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:33,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 16:34:33,035 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:33,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash -90966596, now seen corresponding path program 3 times [2024-06-04 16:34:33,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:33,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455615038] [2024-06-04 16:34:33,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:33,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:44,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455615038] [2024-06-04 16:34:44,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455615038] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:44,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:44,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:44,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810377508] [2024-06-04 16:34:44,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:44,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:44,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:44,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:44,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:44,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:44,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 119 transitions, 1149 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:44,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:44,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:44,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:45,175 INFO L124 PetriNetUnfolderBase]: 280/516 cut-off events. [2024-06-04 16:34:45,175 INFO L125 PetriNetUnfolderBase]: For 20407/20407 co-relation queries the response was YES. [2024-06-04 16:34:45,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3822 conditions, 516 events. 280/516 cut-off events. For 20407/20407 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2160 event pairs, 36 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 3758. Up to 405 conditions per place. [2024-06-04 16:34:45,179 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 97 selfloop transitions, 34 changer transitions 0/134 dead transitions. [2024-06-04 16:34:45,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 134 transitions, 1603 flow [2024-06-04 16:34:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:45,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:34:45,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:34:45,181 INFO L175 Difference]: Start difference. First operand has 127 places, 119 transitions, 1149 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:34:45,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 134 transitions, 1603 flow [2024-06-04 16:34:45,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 1540 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-06-04 16:34:45,211 INFO L231 Difference]: Finished difference. Result has 132 places, 123 transitions, 1259 flow [2024-06-04 16:34:45,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1086, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1259, PETRI_PLACES=132, PETRI_TRANSITIONS=123} [2024-06-04 16:34:45,211 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-04 16:34:45,212 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 123 transitions, 1259 flow [2024-06-04 16:34:45,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:45,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:45,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:45,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 16:34:45,212 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -563567129, now seen corresponding path program 4 times [2024-06-04 16:34:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640364702] [2024-06-04 16:34:45,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:45,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:34:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:34:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:34:52,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640364702] [2024-06-04 16:34:52,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640364702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:34:52,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:34:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:34:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656804017] [2024-06-04 16:34:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:34:52,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:34:52,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:34:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:34:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:34:52,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:34:52,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 123 transitions, 1259 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:52,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:34:52,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:34:52,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:34:52,668 INFO L124 PetriNetUnfolderBase]: 276/510 cut-off events. [2024-06-04 16:34:52,669 INFO L125 PetriNetUnfolderBase]: For 20982/20982 co-relation queries the response was YES. [2024-06-04 16:34:52,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3786 conditions, 510 events. 276/510 cut-off events. For 20982/20982 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2132 event pairs, 36 based on Foata normal form. 2/510 useless extension candidates. Maximal degree in co-relation 3720. Up to 417 conditions per place. [2024-06-04 16:34:52,672 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 103 selfloop transitions, 27 changer transitions 0/133 dead transitions. [2024-06-04 16:34:52,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 133 transitions, 1543 flow [2024-06-04 16:34:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:34:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:34:52,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:34:52,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:34:52,674 INFO L175 Difference]: Start difference. First operand has 132 places, 123 transitions, 1259 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:34:52,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 133 transitions, 1543 flow [2024-06-04 16:34:52,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 133 transitions, 1431 flow, removed 41 selfloop flow, removed 5 redundant places. [2024-06-04 16:34:52,697 INFO L231 Difference]: Finished difference. Result has 136 places, 123 transitions, 1207 flow [2024-06-04 16:34:52,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=136, PETRI_TRANSITIONS=123} [2024-06-04 16:34:52,698 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 105 predicate places. [2024-06-04 16:34:52,698 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 123 transitions, 1207 flow [2024-06-04 16:34:52,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:34:52,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:34:52,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:34:52,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 16:34:52,699 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:34:52,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:34:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash -563567346, now seen corresponding path program 4 times [2024-06-04 16:34:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:34:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887093005] [2024-06-04 16:34:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:34:52,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:34:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:05,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887093005] [2024-06-04 16:35:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887093005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535867813] [2024-06-04 16:35:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:05,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:05,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:05,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 123 transitions, 1207 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:05,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:05,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:05,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:06,069 INFO L124 PetriNetUnfolderBase]: 274/507 cut-off events. [2024-06-04 16:35:06,070 INFO L125 PetriNetUnfolderBase]: For 19890/19890 co-relation queries the response was YES. [2024-06-04 16:35:06,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3715 conditions, 507 events. 274/507 cut-off events. For 19890/19890 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2112 event pairs, 36 based on Foata normal form. 1/506 useless extension candidates. Maximal degree in co-relation 3647. Up to 417 conditions per place. [2024-06-04 16:35:06,074 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 104 selfloop transitions, 26 changer transitions 0/133 dead transitions. [2024-06-04 16:35:06,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 1491 flow [2024-06-04 16:35:06,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:06,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:35:06,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 16:35:06,085 INFO L175 Difference]: Start difference. First operand has 136 places, 123 transitions, 1207 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:35:06,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 1491 flow [2024-06-04 16:35:06,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 133 transitions, 1401 flow, removed 20 selfloop flow, removed 7 redundant places. [2024-06-04 16:35:06,127 INFO L231 Difference]: Finished difference. Result has 138 places, 123 transitions, 1174 flow [2024-06-04 16:35:06,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=138, PETRI_TRANSITIONS=123} [2024-06-04 16:35:06,128 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-06-04 16:35:06,128 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 123 transitions, 1174 flow [2024-06-04 16:35:06,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:06,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:06,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 16:35:06,129 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:06,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:06,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1705693285, now seen corresponding path program 5 times [2024-06-04 16:35:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425209574] [2024-06-04 16:35:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425209574] [2024-06-04 16:35:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425209574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677839886] [2024-06-04 16:35:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:14,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:14,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:14,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:14,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:14,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:14,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 123 transitions, 1174 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:14,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:14,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:14,969 INFO L124 PetriNetUnfolderBase]: 277/512 cut-off events. [2024-06-04 16:35:14,969 INFO L125 PetriNetUnfolderBase]: For 20748/20748 co-relation queries the response was YES. [2024-06-04 16:35:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3742 conditions, 512 events. 277/512 cut-off events. For 20748/20748 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2128 event pairs, 37 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 3673. Up to 467 conditions per place. [2024-06-04 16:35:14,974 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 116 selfloop transitions, 14 changer transitions 0/133 dead transitions. [2024-06-04 16:35:14,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 133 transitions, 1486 flow [2024-06-04 16:35:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 16:35:14,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2024-06-04 16:35:14,976 INFO L175 Difference]: Start difference. First operand has 138 places, 123 transitions, 1174 flow. Second operand 9 states and 105 transitions. [2024-06-04 16:35:14,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 133 transitions, 1486 flow [2024-06-04 16:35:15,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 133 transitions, 1405 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:35:15,018 INFO L231 Difference]: Finished difference. Result has 139 places, 125 transitions, 1164 flow [2024-06-04 16:35:15,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=139, PETRI_TRANSITIONS=125} [2024-06-04 16:35:15,018 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 108 predicate places. [2024-06-04 16:35:15,018 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 125 transitions, 1164 flow [2024-06-04 16:35:15,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:15,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:15,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:15,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 16:35:15,019 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:15,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960195, now seen corresponding path program 6 times [2024-06-04 16:35:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130445152] [2024-06-04 16:35:15,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:15,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:22,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:22,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130445152] [2024-06-04 16:35:22,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130445152] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:22,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:22,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:22,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213174592] [2024-06-04 16:35:22,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:22,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:22,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:22,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:22,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:22,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 125 transitions, 1164 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:22,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:22,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:22,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:22,937 INFO L124 PetriNetUnfolderBase]: 290/534 cut-off events. [2024-06-04 16:35:22,937 INFO L125 PetriNetUnfolderBase]: For 23477/23477 co-relation queries the response was YES. [2024-06-04 16:35:22,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 534 events. 290/534 cut-off events. For 23477/23477 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2262 event pairs, 42 based on Foata normal form. 1/530 useless extension candidates. Maximal degree in co-relation 3932. Up to 344 conditions per place. [2024-06-04 16:35:22,941 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 78 selfloop transitions, 62 changer transitions 0/143 dead transitions. [2024-06-04 16:35:22,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 1786 flow [2024-06-04 16:35:22,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:22,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-04 16:35:22,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4097222222222222 [2024-06-04 16:35:22,945 INFO L175 Difference]: Start difference. First operand has 139 places, 125 transitions, 1164 flow. Second operand 9 states and 118 transitions. [2024-06-04 16:35:22,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 1786 flow [2024-06-04 16:35:22,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 143 transitions, 1728 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 16:35:22,992 INFO L231 Difference]: Finished difference. Result has 142 places, 133 transitions, 1442 flow [2024-06-04 16:35:22,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1442, PETRI_PLACES=142, PETRI_TRANSITIONS=133} [2024-06-04 16:35:22,993 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 111 predicate places. [2024-06-04 16:35:22,993 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 133 transitions, 1442 flow [2024-06-04 16:35:22,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:22,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:22,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 16:35:22,994 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:22,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1962662515, now seen corresponding path program 7 times [2024-06-04 16:35:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131673883] [2024-06-04 16:35:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:30,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131673883] [2024-06-04 16:35:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131673883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:30,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:30,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:30,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41393219] [2024-06-04 16:35:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:30,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:30,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:30,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 133 transitions, 1442 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:30,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:30,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:30,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:30,931 INFO L124 PetriNetUnfolderBase]: 297/546 cut-off events. [2024-06-04 16:35:30,932 INFO L125 PetriNetUnfolderBase]: For 26561/26561 co-relation queries the response was YES. [2024-06-04 16:35:30,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 546 events. 297/546 cut-off events. For 26561/26561 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2343 event pairs, 43 based on Foata normal form. 4/545 useless extension candidates. Maximal degree in co-relation 4213. Up to 434 conditions per place. [2024-06-04 16:35:30,936 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 110 selfloop transitions, 33 changer transitions 0/146 dead transitions. [2024-06-04 16:35:30,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 146 transitions, 1854 flow [2024-06-04 16:35:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:35:30,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:35:30,938 INFO L175 Difference]: Start difference. First operand has 142 places, 133 transitions, 1442 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:35:30,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 146 transitions, 1854 flow [2024-06-04 16:35:30,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 146 transitions, 1775 flow, removed 30 selfloop flow, removed 3 redundant places. [2024-06-04 16:35:30,992 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 1536 flow [2024-06-04 16:35:30,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1363, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1536, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2024-06-04 16:35:30,993 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 117 predicate places. [2024-06-04 16:35:30,993 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 1536 flow [2024-06-04 16:35:30,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:30,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:30,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:30,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 16:35:30,994 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:30,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1616167348, now seen corresponding path program 5 times [2024-06-04 16:35:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250738263] [2024-06-04 16:35:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:39,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:39,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:39,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250738263] [2024-06-04 16:35:39,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250738263] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:39,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:39,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:39,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157442482] [2024-06-04 16:35:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:39,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:39,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:39,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:39,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:39,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 1536 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:39,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:39,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:39,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:40,214 INFO L124 PetriNetUnfolderBase]: 300/553 cut-off events. [2024-06-04 16:35:40,215 INFO L125 PetriNetUnfolderBase]: For 26104/26104 co-relation queries the response was YES. [2024-06-04 16:35:40,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 553 events. 300/553 cut-off events. For 26104/26104 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2386 event pairs, 42 based on Foata normal form. 1/549 useless extension candidates. Maximal degree in co-relation 4364. Up to 448 conditions per place. [2024-06-04 16:35:40,219 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 114 selfloop transitions, 30 changer transitions 0/147 dead transitions. [2024-06-04 16:35:40,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 147 transitions, 1898 flow [2024-06-04 16:35:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:40,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-04 16:35:40,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 16:35:40,220 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 1536 flow. Second operand 9 states and 112 transitions. [2024-06-04 16:35:40,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 147 transitions, 1898 flow [2024-06-04 16:35:40,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 147 transitions, 1752 flow, removed 43 selfloop flow, removed 7 redundant places. [2024-06-04 16:35:40,258 INFO L231 Difference]: Finished difference. Result has 150 places, 139 transitions, 1515 flow [2024-06-04 16:35:40,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1515, PETRI_PLACES=150, PETRI_TRANSITIONS=139} [2024-06-04 16:35:40,259 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 119 predicate places. [2024-06-04 16:35:40,259 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 139 transitions, 1515 flow [2024-06-04 16:35:40,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:40,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:40,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:40,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 16:35:40,261 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:40,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:40,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952476, now seen corresponding path program 1 times [2024-06-04 16:35:40,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:40,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020137533] [2024-06-04 16:35:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:40,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020137533] [2024-06-04 16:35:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020137533] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209749206] [2024-06-04 16:35:50,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:50,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:50,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:50,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:50,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:35:50,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 139 transitions, 1515 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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) [2024-06-04 16:35:50,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:50,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:35:50,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:51,130 INFO L124 PetriNetUnfolderBase]: 303/558 cut-off events. [2024-06-04 16:35:51,131 INFO L125 PetriNetUnfolderBase]: For 27140/27140 co-relation queries the response was YES. [2024-06-04 16:35:51,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4436 conditions, 558 events. 303/558 cut-off events. For 27140/27140 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2410 event pairs, 37 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 4361. Up to 458 conditions per place. [2024-06-04 16:35:51,135 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 115 selfloop transitions, 34 changer transitions 0/152 dead transitions. [2024-06-04 16:35:51,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 152 transitions, 1985 flow [2024-06-04 16:35:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2024-06-04 16:35:51,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2024-06-04 16:35:51,137 INFO L175 Difference]: Start difference. First operand has 150 places, 139 transitions, 1515 flow. Second operand 9 states and 104 transitions. [2024-06-04 16:35:51,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 152 transitions, 1985 flow [2024-06-04 16:35:51,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 152 transitions, 1876 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-04 16:35:51,174 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 1551 flow [2024-06-04 16:35:51,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1551, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2024-06-04 16:35:51,175 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 121 predicate places. [2024-06-04 16:35:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 1551 flow [2024-06-04 16:35:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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) [2024-06-04 16:35:51,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:51,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 16:35:51,176 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:51,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:51,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1705952755, now seen corresponding path program 8 times [2024-06-04 16:35:51,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:51,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270911814] [2024-06-04 16:35:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:51,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:35:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:35:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:35:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270911814] [2024-06-04 16:35:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270911814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:35:58,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:35:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:35:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555134258] [2024-06-04 16:35:58,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:35:58,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:35:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:35:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:35:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:35:58,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:35:58,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 1551 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:58,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:35:58,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:35:58,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:35:59,322 INFO L124 PetriNetUnfolderBase]: 314/576 cut-off events. [2024-06-04 16:35:59,322 INFO L125 PetriNetUnfolderBase]: For 29659/29659 co-relation queries the response was YES. [2024-06-04 16:35:59,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 576 events. 314/576 cut-off events. For 29659/29659 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2514 event pairs, 42 based on Foata normal form. 2/573 useless extension candidates. Maximal degree in co-relation 4578. Up to 319 conditions per place. [2024-06-04 16:35:59,327 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 87 selfloop transitions, 72 changer transitions 0/162 dead transitions. [2024-06-04 16:35:59,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 162 transitions, 2319 flow [2024-06-04 16:35:59,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:35:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:35:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-04 16:35:59,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2024-06-04 16:35:59,329 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 1551 flow. Second operand 9 states and 124 transitions. [2024-06-04 16:35:59,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 162 transitions, 2319 flow [2024-06-04 16:35:59,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 162 transitions, 2239 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-04 16:35:59,370 INFO L231 Difference]: Finished difference. Result has 156 places, 151 transitions, 1794 flow [2024-06-04 16:35:59,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1794, PETRI_PLACES=156, PETRI_TRANSITIONS=151} [2024-06-04 16:35:59,371 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-04 16:35:59,371 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 151 transitions, 1794 flow [2024-06-04 16:35:59,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:35:59,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:35:59,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:35:59,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 16:35:59,372 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:35:59,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:35:59,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1705960412, now seen corresponding path program 6 times [2024-06-04 16:35:59,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:35:59,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650183675] [2024-06-04 16:35:59,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:35:59,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:35:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:08,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650183675] [2024-06-04 16:36:08,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650183675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:08,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:08,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:08,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661645113] [2024-06-04 16:36:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:08,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:08,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:08,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:08,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:08,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 151 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:08,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:08,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:08,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:09,029 INFO L124 PetriNetUnfolderBase]: 317/583 cut-off events. [2024-06-04 16:36:09,029 INFO L125 PetriNetUnfolderBase]: For 31053/31053 co-relation queries the response was YES. [2024-06-04 16:36:09,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 583 events. 317/583 cut-off events. For 31053/31053 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2567 event pairs, 43 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 4792. Up to 425 conditions per place. [2024-06-04 16:36:09,033 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 110 selfloop transitions, 51 changer transitions 0/164 dead transitions. [2024-06-04 16:36:09,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 164 transitions, 2344 flow [2024-06-04 16:36:09,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:36:09,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:36:09,035 INFO L175 Difference]: Start difference. First operand has 156 places, 151 transitions, 1794 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:36:09,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 164 transitions, 2344 flow [2024-06-04 16:36:09,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 164 transitions, 2266 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-04 16:36:09,079 INFO L231 Difference]: Finished difference. Result has 162 places, 155 transitions, 1947 flow [2024-06-04 16:36:09,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1947, PETRI_PLACES=162, PETRI_TRANSITIONS=155} [2024-06-04 16:36:09,080 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 131 predicate places. [2024-06-04 16:36:09,080 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 1947 flow [2024-06-04 16:36:09,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:09,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:09,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:09,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 16:36:09,081 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:09,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:09,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1962452986, now seen corresponding path program 2 times [2024-06-04 16:36:09,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113066755] [2024-06-04 16:36:09,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:09,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:17,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113066755] [2024-06-04 16:36:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113066755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:17,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:17,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:17,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452232173] [2024-06-04 16:36:17,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:17,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:17,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:17,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:17,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:17,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-06-04 16:36:17,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 1947 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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) [2024-06-04 16:36:17,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:17,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-06-04 16:36:17,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:17,541 INFO L124 PetriNetUnfolderBase]: 315/580 cut-off events. [2024-06-04 16:36:17,541 INFO L125 PetriNetUnfolderBase]: For 31450/31450 co-relation queries the response was YES. [2024-06-04 16:36:17,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4891 conditions, 580 events. 315/580 cut-off events. For 31450/31450 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2551 event pairs, 38 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 4811. Up to 514 conditions per place. [2024-06-04 16:36:17,546 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 140 selfloop transitions, 20 changer transitions 0/163 dead transitions. [2024-06-04 16:36:17,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 2285 flow [2024-06-04 16:36:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:17,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-04 16:36:17,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2024-06-04 16:36:17,547 INFO L175 Difference]: Start difference. First operand has 162 places, 155 transitions, 1947 flow. Second operand 9 states and 98 transitions. [2024-06-04 16:36:17,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 2285 flow [2024-06-04 16:36:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 2169 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-06-04 16:36:17,592 INFO L231 Difference]: Finished difference. Result has 166 places, 155 transitions, 1876 flow [2024-06-04 16:36:17,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1831, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1876, PETRI_PLACES=166, PETRI_TRANSITIONS=155} [2024-06-04 16:36:17,593 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-04 16:36:17,593 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 155 transitions, 1876 flow [2024-06-04 16:36:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 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) [2024-06-04 16:36:17,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:17,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:17,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 16:36:17,593 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:17,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1962460705, now seen corresponding path program 9 times [2024-06-04 16:36:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526397485] [2024-06-04 16:36:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:26,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526397485] [2024-06-04 16:36:26,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526397485] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:26,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:26,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:26,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053441735] [2024-06-04 16:36:26,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:26,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:26,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:26,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:26,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:26,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 155 transitions, 1876 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:26,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:26,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:26,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:27,029 INFO L124 PetriNetUnfolderBase]: 318/585 cut-off events. [2024-06-04 16:36:27,029 INFO L125 PetriNetUnfolderBase]: For 31918/31918 co-relation queries the response was YES. [2024-06-04 16:36:27,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4902 conditions, 585 events. 318/585 cut-off events. For 31918/31918 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2565 event pairs, 42 based on Foata normal form. 1/581 useless extension candidates. Maximal degree in co-relation 4820. Up to 459 conditions per place. [2024-06-04 16:36:27,034 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 126 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2024-06-04 16:36:27,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 2381 flow [2024-06-04 16:36:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 16:36:27,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40625 [2024-06-04 16:36:27,036 INFO L175 Difference]: Start difference. First operand has 166 places, 155 transitions, 1876 flow. Second operand 9 states and 117 transitions. [2024-06-04 16:36:27,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 2381 flow [2024-06-04 16:36:27,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 167 transitions, 2313 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 16:36:27,091 INFO L231 Difference]: Finished difference. Result has 167 places, 158 transitions, 1954 flow [2024-06-04 16:36:27,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1954, PETRI_PLACES=167, PETRI_TRANSITIONS=158} [2024-06-04 16:36:27,091 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 136 predicate places. [2024-06-04 16:36:27,092 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 158 transitions, 1954 flow [2024-06-04 16:36:27,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:27,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:27,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:27,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 16:36:27,092 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:27,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash 488853758, now seen corresponding path program 7 times [2024-06-04 16:36:27,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747988516] [2024-06-04 16:36:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:27,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:36,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747988516] [2024-06-04 16:36:36,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747988516] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:36,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:36,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:36,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711376442] [2024-06-04 16:36:36,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:36,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:36,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:36,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:36,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 158 transitions, 1954 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:36,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:36,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:36,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:36,580 INFO L124 PetriNetUnfolderBase]: 316/582 cut-off events. [2024-06-04 16:36:36,580 INFO L125 PetriNetUnfolderBase]: For 32133/32133 co-relation queries the response was YES. [2024-06-04 16:36:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 582 events. 316/582 cut-off events. For 32133/32133 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2554 event pairs, 43 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 4795. Up to 466 conditions per place. [2024-06-04 16:36:36,585 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 129 selfloop transitions, 34 changer transitions 0/166 dead transitions. [2024-06-04 16:36:36,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 2298 flow [2024-06-04 16:36:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:36,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:36:36,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:36:36,587 INFO L175 Difference]: Start difference. First operand has 167 places, 158 transitions, 1954 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:36:36,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 2298 flow [2024-06-04 16:36:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 2130 flow, removed 36 selfloop flow, removed 6 redundant places. [2024-06-04 16:36:36,640 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1859 flow [2024-06-04 16:36:36,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1786, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1859, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-04 16:36:36,640 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 139 predicate places. [2024-06-04 16:36:36,640 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1859 flow [2024-06-04 16:36:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:36,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:36,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:36,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 16:36:36,641 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:36,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1962453265, now seen corresponding path program 10 times [2024-06-04 16:36:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936119821] [2024-06-04 16:36:36,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:44,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936119821] [2024-06-04 16:36:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936119821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:44,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339592974] [2024-06-04 16:36:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:44,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:44,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:45,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:45,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1859 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:45,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:45,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:45,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:45,451 INFO L124 PetriNetUnfolderBase]: 314/579 cut-off events. [2024-06-04 16:36:45,452 INFO L125 PetriNetUnfolderBase]: For 31750/31750 co-relation queries the response was YES. [2024-06-04 16:36:45,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4734 conditions, 579 events. 314/579 cut-off events. For 31750/31750 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2531 event pairs, 42 based on Foata normal form. 1/575 useless extension candidates. Maximal degree in co-relation 4650. Up to 454 conditions per place. [2024-06-04 16:36:45,456 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 124 selfloop transitions, 39 changer transitions 0/166 dead transitions. [2024-06-04 16:36:45,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 166 transitions, 2203 flow [2024-06-04 16:36:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:45,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 16:36:45,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2024-06-04 16:36:45,460 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1859 flow. Second operand 9 states and 116 transitions. [2024-06-04 16:36:45,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 166 transitions, 2203 flow [2024-06-04 16:36:45,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 166 transitions, 2005 flow, removed 35 selfloop flow, removed 10 redundant places. [2024-06-04 16:36:45,511 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 1744 flow [2024-06-04 16:36:45,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1744, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2024-06-04 16:36:45,512 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2024-06-04 16:36:45,512 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 1744 flow [2024-06-04 16:36:45,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:45,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:45,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:45,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 16:36:45,512 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:45,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash 135655998, now seen corresponding path program 1 times [2024-06-04 16:36:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053900887] [2024-06-04 16:36:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:51,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:51,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053900887] [2024-06-04 16:36:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053900887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:51,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936644181] [2024-06-04 16:36:51,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:51,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:51,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:51,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:51,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:51,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 1744 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:51,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:51,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:51,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:52,234 INFO L124 PetriNetUnfolderBase]: 318/586 cut-off events. [2024-06-04 16:36:52,234 INFO L125 PetriNetUnfolderBase]: For 33851/33851 co-relation queries the response was YES. [2024-06-04 16:36:52,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 586 events. 318/586 cut-off events. For 33851/33851 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2580 event pairs, 15 based on Foata normal form. 2/586 useless extension candidates. Maximal degree in co-relation 4579. Up to 484 conditions per place. [2024-06-04 16:36:52,239 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 154 selfloop transitions, 19 changer transitions 0/176 dead transitions. [2024-06-04 16:36:52,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 176 transitions, 2154 flow [2024-06-04 16:36:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:36:52,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 16:36:52,242 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 1744 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:36:52,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 176 transitions, 2154 flow [2024-06-04 16:36:52,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 176 transitions, 2081 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 16:36:52,295 INFO L231 Difference]: Finished difference. Result has 171 places, 159 transitions, 1733 flow [2024-06-04 16:36:52,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1671, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1733, PETRI_PLACES=171, PETRI_TRANSITIONS=159} [2024-06-04 16:36:52,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-04 16:36:52,295 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 159 transitions, 1733 flow [2024-06-04 16:36:52,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:52,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:52,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:52,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 16:36:52,296 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:52,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:52,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1576362194, now seen corresponding path program 2 times [2024-06-04 16:36:52,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:52,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753337199] [2024-06-04 16:36:52,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:52,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:36:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:36:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:36:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753337199] [2024-06-04 16:36:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753337199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:36:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:36:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:36:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172811199] [2024-06-04 16:36:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:36:57,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:36:57,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:36:57,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:36:57,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:36:58,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:36:58,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 159 transitions, 1733 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:58,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:36:58,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:36:58,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:36:58,577 INFO L124 PetriNetUnfolderBase]: 322/594 cut-off events. [2024-06-04 16:36:58,578 INFO L125 PetriNetUnfolderBase]: For 35216/35216 co-relation queries the response was YES. [2024-06-04 16:36:58,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 594 events. 322/594 cut-off events. For 35216/35216 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2624 event pairs, 32 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 4636. Up to 509 conditions per place. [2024-06-04 16:36:58,583 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 153 selfloop transitions, 20 changer transitions 0/176 dead transitions. [2024-06-04 16:36:58,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 176 transitions, 2143 flow [2024-06-04 16:36:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:36:58,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:36:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 16:36:58,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2024-06-04 16:36:58,585 INFO L175 Difference]: Start difference. First operand has 171 places, 159 transitions, 1733 flow. Second operand 9 states and 114 transitions. [2024-06-04 16:36:58,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 176 transitions, 2143 flow [2024-06-04 16:36:58,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 2091 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 16:36:58,641 INFO L231 Difference]: Finished difference. Result has 173 places, 160 transitions, 1747 flow [2024-06-04 16:36:58,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1681, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1747, PETRI_PLACES=173, PETRI_TRANSITIONS=160} [2024-06-04 16:36:58,641 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 142 predicate places. [2024-06-04 16:36:58,641 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 160 transitions, 1747 flow [2024-06-04 16:36:58,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:36:58,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:36:58,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:36:58,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 16:36:58,642 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:36:58,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:36:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1576367154, now seen corresponding path program 1 times [2024-06-04 16:36:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:36:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481871406] [2024-06-04 16:36:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:36:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:36:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481871406] [2024-06-04 16:37:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481871406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738013897] [2024-06-04 16:37:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:08,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:08,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:08,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 160 transitions, 1747 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:08,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:08,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:08,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:09,377 INFO L124 PetriNetUnfolderBase]: 325/601 cut-off events. [2024-06-04 16:37:09,377 INFO L125 PetriNetUnfolderBase]: For 36051/36051 co-relation queries the response was YES. [2024-06-04 16:37:09,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 601 events. 325/601 cut-off events. For 36051/36051 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2692 event pairs, 31 based on Foata normal form. 1/600 useless extension candidates. Maximal degree in co-relation 4699. Up to 514 conditions per place. [2024-06-04 16:37:09,382 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 152 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-06-04 16:37:09,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 178 transitions, 2189 flow [2024-06-04 16:37:09,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:09,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:37:09,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 16:37:09,383 INFO L175 Difference]: Start difference. First operand has 173 places, 160 transitions, 1747 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:37:09,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 178 transitions, 2189 flow [2024-06-04 16:37:09,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 178 transitions, 2133 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 16:37:09,440 INFO L231 Difference]: Finished difference. Result has 176 places, 162 transitions, 1794 flow [2024-06-04 16:37:09,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1691, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1794, PETRI_PLACES=176, PETRI_TRANSITIONS=162} [2024-06-04 16:37:09,441 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 145 predicate places. [2024-06-04 16:37:09,441 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 162 transitions, 1794 flow [2024-06-04 16:37:09,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:09,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:09,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:09,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 16:37:09,441 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:09,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:09,442 INFO L85 PathProgramCache]: Analyzing trace with hash -456534054, now seen corresponding path program 3 times [2024-06-04 16:37:09,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:09,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410792536] [2024-06-04 16:37:09,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:09,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:15,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:15,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410792536] [2024-06-04 16:37:15,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410792536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:15,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:15,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:37:15,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381544835] [2024-06-04 16:37:15,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:15,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:37:15,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:15,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:37:15,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:37:15,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:15,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 162 transitions, 1794 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:37:15,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:15,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:15,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:16,283 INFO L124 PetriNetUnfolderBase]: 329/609 cut-off events. [2024-06-04 16:37:16,283 INFO L125 PetriNetUnfolderBase]: For 38774/38774 co-relation queries the response was YES. [2024-06-04 16:37:16,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4861 conditions, 609 events. 329/609 cut-off events. For 38774/38774 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2732 event pairs, 31 based on Foata normal form. 2/609 useless extension candidates. Maximal degree in co-relation 4775. Up to 527 conditions per place. [2024-06-04 16:37:16,288 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 151 selfloop transitions, 22 changer transitions 0/176 dead transitions. [2024-06-04 16:37:16,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 176 transitions, 2194 flow [2024-06-04 16:37:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:16,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:37:16,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 16:37:16,289 INFO L175 Difference]: Start difference. First operand has 176 places, 162 transitions, 1794 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:37:16,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 176 transitions, 2194 flow [2024-06-04 16:37:16,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 176 transitions, 2107 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:16,346 INFO L231 Difference]: Finished difference. Result has 177 places, 163 transitions, 1779 flow [2024-06-04 16:37:16,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1779, PETRI_PLACES=177, PETRI_TRANSITIONS=163} [2024-06-04 16:37:16,346 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 146 predicate places. [2024-06-04 16:37:16,346 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 163 transitions, 1779 flow [2024-06-04 16:37:16,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:37:16,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:16,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:16,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 16:37:16,347 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:16,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash -456349604, now seen corresponding path program 2 times [2024-06-04 16:37:16,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:16,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399476160] [2024-06-04 16:37:16,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:25,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399476160] [2024-06-04 16:37:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399476160] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731800504] [2024-06-04 16:37:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:25,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:25,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 163 transitions, 1779 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:25,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:25,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:25,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:25,787 INFO L124 PetriNetUnfolderBase]: 356/658 cut-off events. [2024-06-04 16:37:25,787 INFO L125 PetriNetUnfolderBase]: For 46841/46841 co-relation queries the response was YES. [2024-06-04 16:37:25,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5523 conditions, 658 events. 356/658 cut-off events. For 46841/46841 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3031 event pairs, 29 based on Foata normal form. 2/658 useless extension candidates. Maximal degree in co-relation 5436. Up to 534 conditions per place. [2024-06-04 16:37:25,792 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 150 selfloop transitions, 33 changer transitions 0/186 dead transitions. [2024-06-04 16:37:25,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 186 transitions, 2484 flow [2024-06-04 16:37:25,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:25,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:25,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 16:37:25,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-04 16:37:25,796 INFO L175 Difference]: Start difference. First operand has 177 places, 163 transitions, 1779 flow. Second operand 10 states and 127 transitions. [2024-06-04 16:37:25,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 186 transitions, 2484 flow [2024-06-04 16:37:25,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 186 transitions, 2400 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:25,866 INFO L231 Difference]: Finished difference. Result has 180 places, 171 transitions, 1971 flow [2024-06-04 16:37:25,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1695, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1971, PETRI_PLACES=180, PETRI_TRANSITIONS=171} [2024-06-04 16:37:25,866 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2024-06-04 16:37:25,867 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 171 transitions, 1971 flow [2024-06-04 16:37:25,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:25,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:25,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:25,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 16:37:25,867 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:25,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1691838062, now seen corresponding path program 1 times [2024-06-04 16:37:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:25,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184438621] [2024-06-04 16:37:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:25,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:33,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184438621] [2024-06-04 16:37:33,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184438621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:33,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:33,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:33,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617872227] [2024-06-04 16:37:33,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:33,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:33,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:33,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:33,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:34,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:34,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 171 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:34,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:34,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:34,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:34,646 INFO L124 PetriNetUnfolderBase]: 354/656 cut-off events. [2024-06-04 16:37:34,646 INFO L125 PetriNetUnfolderBase]: For 46923/46923 co-relation queries the response was YES. [2024-06-04 16:37:34,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 656 events. 354/656 cut-off events. For 46923/46923 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3016 event pairs, 30 based on Foata normal form. 3/657 useless extension candidates. Maximal degree in co-relation 5385. Up to 527 conditions per place. [2024-06-04 16:37:34,652 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 149 selfloop transitions, 35 changer transitions 0/187 dead transitions. [2024-06-04 16:37:34,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 187 transitions, 2429 flow [2024-06-04 16:37:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:37:34,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 16:37:34,653 INFO L175 Difference]: Start difference. First operand has 180 places, 171 transitions, 1971 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:37:34,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 187 transitions, 2429 flow [2024-06-04 16:37:34,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 187 transitions, 2329 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-04 16:37:34,738 INFO L231 Difference]: Finished difference. Result has 184 places, 173 transitions, 2006 flow [2024-06-04 16:37:34,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2006, PETRI_PLACES=184, PETRI_TRANSITIONS=173} [2024-06-04 16:37:34,739 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 153 predicate places. [2024-06-04 16:37:34,739 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 173 transitions, 2006 flow [2024-06-04 16:37:34,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:34,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:34,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:34,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 16:37:34,740 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:34,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:34,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1691831304, now seen corresponding path program 3 times [2024-06-04 16:37:34,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952763635] [2024-06-04 16:37:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:34,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:43,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:43,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952763635] [2024-06-04 16:37:43,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952763635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:43,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:37:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208772810] [2024-06-04 16:37:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:43,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:37:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:37:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:37:43,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:43,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 173 transitions, 2006 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:43,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:43,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:43,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:44,186 INFO L124 PetriNetUnfolderBase]: 352/653 cut-off events. [2024-06-04 16:37:44,187 INFO L125 PetriNetUnfolderBase]: For 43246/43246 co-relation queries the response was YES. [2024-06-04 16:37:44,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 653 events. 352/653 cut-off events. For 43246/43246 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3005 event pairs, 30 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 5307. Up to 548 conditions per place. [2024-06-04 16:37:44,193 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 156 selfloop transitions, 30 changer transitions 0/189 dead transitions. [2024-06-04 16:37:44,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 189 transitions, 2468 flow [2024-06-04 16:37:44,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:37:44,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:37:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:37:44,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:37:44,194 INFO L175 Difference]: Start difference. First operand has 184 places, 173 transitions, 2006 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:37:44,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 189 transitions, 2468 flow [2024-06-04 16:37:44,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 189 transitions, 2319 flow, removed 43 selfloop flow, removed 8 redundant places. [2024-06-04 16:37:44,273 INFO L231 Difference]: Finished difference. Result has 187 places, 176 transitions, 1992 flow [2024-06-04 16:37:44,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1992, PETRI_PLACES=187, PETRI_TRANSITIONS=176} [2024-06-04 16:37:44,274 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2024-06-04 16:37:44,274 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 176 transitions, 1992 flow [2024-06-04 16:37:44,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:37:44,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:44,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:44,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 16:37:44,275 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:44,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1857292498, now seen corresponding path program 4 times [2024-06-04 16:37:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312481607] [2024-06-04 16:37:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:37:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:37:51,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:37:51,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312481607] [2024-06-04 16:37:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312481607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:37:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:37:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:37:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159287379] [2024-06-04 16:37:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:37:51,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:37:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:37:51,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:37:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:37:51,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:37:51,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 176 transitions, 1992 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:37:51,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:37:51,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:37:51,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:37:52,201 INFO L124 PetriNetUnfolderBase]: 356/661 cut-off events. [2024-06-04 16:37:52,201 INFO L125 PetriNetUnfolderBase]: For 46664/46664 co-relation queries the response was YES. [2024-06-04 16:37:52,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5413 conditions, 661 events. 356/661 cut-off events. For 46664/46664 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3047 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5321. Up to 562 conditions per place. [2024-06-04 16:37:52,207 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 162 selfloop transitions, 23 changer transitions 0/188 dead transitions. [2024-06-04 16:37:52,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 2412 flow [2024-06-04 16:37:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:37:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:37:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 16:37:52,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2024-06-04 16:37:52,208 INFO L175 Difference]: Start difference. First operand has 187 places, 176 transitions, 1992 flow. Second operand 9 states and 111 transitions. [2024-06-04 16:37:52,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 188 transitions, 2412 flow [2024-06-04 16:37:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 188 transitions, 2315 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-04 16:37:52,283 INFO L231 Difference]: Finished difference. Result has 189 places, 177 transitions, 1971 flow [2024-06-04 16:37:52,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1971, PETRI_PLACES=189, PETRI_TRANSITIONS=177} [2024-06-04 16:37:52,283 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 158 predicate places. [2024-06-04 16:37:52,284 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 177 transitions, 1971 flow [2024-06-04 16:37:52,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:37:52,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:37:52,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:37:52,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 16:37:52,284 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:37:52,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:37:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash -682667282, now seen corresponding path program 2 times [2024-06-04 16:37:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:37:52,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379795390] [2024-06-04 16:37:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:37:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:37:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:00,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379795390] [2024-06-04 16:38:00,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379795390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:00,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:00,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:00,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550979213] [2024-06-04 16:38:00,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:00,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:00,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:00,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:00,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:00,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 177 transitions, 1971 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:00,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:00,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:00,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:01,121 INFO L124 PetriNetUnfolderBase]: 357/661 cut-off events. [2024-06-04 16:38:01,121 INFO L125 PetriNetUnfolderBase]: For 46551/46551 co-relation queries the response was YES. [2024-06-04 16:38:01,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 661 events. 357/661 cut-off events. For 46551/46551 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3041 event pairs, 32 based on Foata normal form. 2/661 useless extension candidates. Maximal degree in co-relation 5267. Up to 552 conditions per place. [2024-06-04 16:38:01,127 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 157 selfloop transitions, 30 changer transitions 0/190 dead transitions. [2024-06-04 16:38:01,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 190 transitions, 2415 flow [2024-06-04 16:38:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:38:01,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:38:01,129 INFO L175 Difference]: Start difference. First operand has 189 places, 177 transitions, 1971 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:38:01,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 190 transitions, 2415 flow [2024-06-04 16:38:01,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 190 transitions, 2349 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 16:38:01,212 INFO L231 Difference]: Finished difference. Result has 192 places, 179 transitions, 2019 flow [2024-06-04 16:38:01,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2019, PETRI_PLACES=192, PETRI_TRANSITIONS=179} [2024-06-04 16:38:01,213 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-04 16:38:01,213 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 179 transitions, 2019 flow [2024-06-04 16:38:01,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:01,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:01,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:01,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 16:38:01,213 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:01,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733058, now seen corresponding path program 4 times [2024-06-04 16:38:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118819365] [2024-06-04 16:38:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:10,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118819365] [2024-06-04 16:38:10,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118819365] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:10,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858097524] [2024-06-04 16:38:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:10,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:10,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:10,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:10,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:11,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:38:11,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 179 transitions, 2019 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:38:11,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:11,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:38:11,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:11,472 INFO L124 PetriNetUnfolderBase]: 375/696 cut-off events. [2024-06-04 16:38:11,472 INFO L125 PetriNetUnfolderBase]: For 52863/52863 co-relation queries the response was YES. [2024-06-04 16:38:11,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 696 events. 375/696 cut-off events. For 52863/52863 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3274 event pairs, 31 based on Foata normal form. 1/695 useless extension candidates. Maximal degree in co-relation 5828. Up to 526 conditions per place. [2024-06-04 16:38:11,478 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 149 selfloop transitions, 49 changer transitions 0/201 dead transitions. [2024-06-04 16:38:11,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 201 transitions, 3035 flow [2024-06-04 16:38:11,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 140 transitions. [2024-06-04 16:38:11,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 16:38:11,480 INFO L175 Difference]: Start difference. First operand has 192 places, 179 transitions, 2019 flow. Second operand 10 states and 140 transitions. [2024-06-04 16:38:11,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 201 transitions, 3035 flow [2024-06-04 16:38:11,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 201 transitions, 2908 flow, removed 26 selfloop flow, removed 9 redundant places. [2024-06-04 16:38:11,569 INFO L231 Difference]: Finished difference. Result has 193 places, 187 transitions, 2239 flow [2024-06-04 16:38:11,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2239, PETRI_PLACES=193, PETRI_TRANSITIONS=187} [2024-06-04 16:38:11,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 162 predicate places. [2024-06-04 16:38:11,569 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 187 transitions, 2239 flow [2024-06-04 16:38:11,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:38:11,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:11,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:11,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 16:38:11,570 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:11,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1863733306, now seen corresponding path program 3 times [2024-06-04 16:38:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23557137] [2024-06-04 16:38:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:19,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:19,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23557137] [2024-06-04 16:38:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23557137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:19,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847253575] [2024-06-04 16:38:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:19,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:19,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:19,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:19,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:19,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 187 transitions, 2239 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:19,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:19,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:19,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:20,070 INFO L124 PetriNetUnfolderBase]: 373/693 cut-off events. [2024-06-04 16:38:20,071 INFO L125 PetriNetUnfolderBase]: For 52793/52793 co-relation queries the response was YES. [2024-06-04 16:38:20,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 693 events. 373/693 cut-off events. For 52793/52793 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3262 event pairs, 31 based on Foata normal form. 1/692 useless extension candidates. Maximal degree in co-relation 5749. Up to 552 conditions per place. [2024-06-04 16:38:20,077 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 154 selfloop transitions, 41 changer transitions 0/198 dead transitions. [2024-06-04 16:38:20,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 198 transitions, 2655 flow [2024-06-04 16:38:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:20,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 16:38:20,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.390625 [2024-06-04 16:38:20,079 INFO L175 Difference]: Start difference. First operand has 193 places, 187 transitions, 2239 flow. Second operand 10 states and 125 transitions. [2024-06-04 16:38:20,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 198 transitions, 2655 flow [2024-06-04 16:38:20,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 198 transitions, 2534 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-04 16:38:20,169 INFO L231 Difference]: Finished difference. Result has 199 places, 187 transitions, 2205 flow [2024-06-04 16:38:20,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2205, PETRI_PLACES=199, PETRI_TRANSITIONS=187} [2024-06-04 16:38:20,169 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 168 predicate places. [2024-06-04 16:38:20,170 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 187 transitions, 2205 flow [2024-06-04 16:38:20,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:20,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:20,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:20,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 16:38:20,170 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:20,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:20,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1863726548, now seen corresponding path program 5 times [2024-06-04 16:38:20,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:20,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445354551] [2024-06-04 16:38:20,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:20,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:29,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445354551] [2024-06-04 16:38:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445354551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:29,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842775943] [2024-06-04 16:38:29,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:29,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:29,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:29,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:29,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 187 transitions, 2205 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:29,995 INFO L124 PetriNetUnfolderBase]: 386/716 cut-off events. [2024-06-04 16:38:29,995 INFO L125 PetriNetUnfolderBase]: For 57404/57404 co-relation queries the response was YES. [2024-06-04 16:38:29,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 716 events. 386/716 cut-off events. For 57404/57404 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3400 event pairs, 33 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 6133. Up to 491 conditions per place. [2024-06-04 16:38:30,002 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 142 selfloop transitions, 62 changer transitions 0/207 dead transitions. [2024-06-04 16:38:30,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 207 transitions, 3179 flow [2024-06-04 16:38:30,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-04 16:38:30,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.415625 [2024-06-04 16:38:30,003 INFO L175 Difference]: Start difference. First operand has 199 places, 187 transitions, 2205 flow. Second operand 10 states and 133 transitions. [2024-06-04 16:38:30,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 207 transitions, 3179 flow [2024-06-04 16:38:30,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 207 transitions, 3035 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-04 16:38:30,110 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 2368 flow [2024-06-04 16:38:30,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2061, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2368, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-06-04 16:38:30,110 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 169 predicate places. [2024-06-04 16:38:30,111 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 2368 flow [2024-06-04 16:38:30,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:30,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:30,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:30,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 16:38:30,111 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:30,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 903795654, now seen corresponding path program 1 times [2024-06-04 16:38:30,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:30,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193777783] [2024-06-04 16:38:30,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:30,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193777783] [2024-06-04 16:38:37,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193777783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:37,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:37,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:37,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209420486] [2024-06-04 16:38:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:37,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:37,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:37,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:38,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:38,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 2368 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:38,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:38,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:38,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:38,508 INFO L124 PetriNetUnfolderBase]: 390/724 cut-off events. [2024-06-04 16:38:38,508 INFO L125 PetriNetUnfolderBase]: For 62009/62009 co-relation queries the response was YES. [2024-06-04 16:38:38,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6324 conditions, 724 events. 390/724 cut-off events. For 62009/62009 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3468 event pairs, 31 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 6228. Up to 645 conditions per place. [2024-06-04 16:38:38,514 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 185 selfloop transitions, 18 changer transitions 0/206 dead transitions. [2024-06-04 16:38:38,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 206 transitions, 2826 flow [2024-06-04 16:38:38,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:38,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:38:38,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 16:38:38,516 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 2368 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:38:38,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 206 transitions, 2826 flow [2024-06-04 16:38:38,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2728 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-04 16:38:38,623 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2336 flow [2024-06-04 16:38:38,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2270, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2336, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-04 16:38:38,624 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-04 16:38:38,624 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2336 flow [2024-06-04 16:38:38,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:38,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:38,625 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:38,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 16:38:38,625 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:38,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1528593658, now seen corresponding path program 6 times [2024-06-04 16:38:38,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:38,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360404354] [2024-06-04 16:38:38,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:38,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:48,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360404354] [2024-06-04 16:38:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360404354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:38:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985718438] [2024-06-04 16:38:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:48,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:38:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:48,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:38:48,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:38:48,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:38:48,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2336 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:38:48,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:48,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:38:48,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:49,332 INFO L124 PetriNetUnfolderBase]: 388/721 cut-off events. [2024-06-04 16:38:49,333 INFO L125 PetriNetUnfolderBase]: For 59506/59506 co-relation queries the response was YES. [2024-06-04 16:38:49,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 721 events. 388/721 cut-off events. For 59506/59506 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3444 event pairs, 32 based on Foata normal form. 1/720 useless extension candidates. Maximal degree in co-relation 6076. Up to 551 conditions per place. [2024-06-04 16:38:49,338 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 150 selfloop transitions, 53 changer transitions 0/206 dead transitions. [2024-06-04 16:38:49,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 2894 flow [2024-06-04 16:38:49,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-04 16:38:49,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-04 16:38:49,340 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2336 flow. Second operand 10 states and 136 transitions. [2024-06-04 16:38:49,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 2894 flow [2024-06-04 16:38:49,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 206 transitions, 2755 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-04 16:38:49,455 INFO L231 Difference]: Finished difference. Result has 204 places, 194 transitions, 2308 flow [2024-06-04 16:38:49,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2308, PETRI_PLACES=204, PETRI_TRANSITIONS=194} [2024-06-04 16:38:49,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 173 predicate places. [2024-06-04 16:38:49,455 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 194 transitions, 2308 flow [2024-06-04 16:38:49,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:38:49,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:49,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:49,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 16:38:49,456 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:49,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:49,456 INFO L85 PathProgramCache]: Analyzing trace with hash 897293466, now seen corresponding path program 7 times [2024-06-04 16:38:49,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:49,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253413402] [2024-06-04 16:38:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:38:58,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:38:58,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:38:58,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253413402] [2024-06-04 16:38:58,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253413402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:38:58,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:38:58,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:38:58,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149790559] [2024-06-04 16:38:58,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:38:58,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:38:58,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:38:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:38:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:38:58,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:38:58,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 194 transitions, 2308 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:58,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:38:58,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:38:58,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:38:59,329 INFO L124 PetriNetUnfolderBase]: 396/738 cut-off events. [2024-06-04 16:38:59,330 INFO L125 PetriNetUnfolderBase]: For 63703/63703 co-relation queries the response was YES. [2024-06-04 16:38:59,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6407 conditions, 738 events. 396/738 cut-off events. For 63703/63703 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3574 event pairs, 32 based on Foata normal form. 1/737 useless extension candidates. Maximal degree in co-relation 6310. Up to 596 conditions per place. [2024-06-04 16:38:59,335 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 170 selfloop transitions, 38 changer transitions 0/211 dead transitions. [2024-06-04 16:38:59,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 3132 flow [2024-06-04 16:38:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:38:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:38:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:38:59,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 16:38:59,338 INFO L175 Difference]: Start difference. First operand has 204 places, 194 transitions, 2308 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:38:59,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 3132 flow [2024-06-04 16:38:59,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 211 transitions, 3034 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 16:38:59,458 INFO L231 Difference]: Finished difference. Result has 206 places, 198 transitions, 2417 flow [2024-06-04 16:38:59,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2417, PETRI_PLACES=206, PETRI_TRANSITIONS=198} [2024-06-04 16:38:59,459 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 175 predicate places. [2024-06-04 16:38:59,459 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 198 transitions, 2417 flow [2024-06-04 16:38:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:38:59,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:38:59,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:38:59,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 16:38:59,460 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:38:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:38:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 897299976, now seen corresponding path program 8 times [2024-06-04 16:38:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:38:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292005539] [2024-06-04 16:38:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:38:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:38:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:07,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:07,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292005539] [2024-06-04 16:39:07,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292005539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:07,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:07,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:39:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222268820] [2024-06-04 16:39:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:07,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:39:07,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:07,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:39:07,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:39:07,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:39:07,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 198 transitions, 2417 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:39:07,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:07,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:39:07,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:07,779 INFO L124 PetriNetUnfolderBase]: 394/735 cut-off events. [2024-06-04 16:39:07,780 INFO L125 PetriNetUnfolderBase]: For 63325/63325 co-relation queries the response was YES. [2024-06-04 16:39:07,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6312 conditions, 735 events. 394/735 cut-off events. For 63325/63325 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3557 event pairs, 32 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 6214. Up to 611 conditions per place. [2024-06-04 16:39:07,786 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 174 selfloop transitions, 32 changer transitions 0/209 dead transitions. [2024-06-04 16:39:07,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 209 transitions, 2855 flow [2024-06-04 16:39:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:39:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:39:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 16:39:07,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-04 16:39:07,787 INFO L175 Difference]: Start difference. First operand has 206 places, 198 transitions, 2417 flow. Second operand 10 states and 134 transitions. [2024-06-04 16:39:07,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 209 transitions, 2855 flow [2024-06-04 16:39:07,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 209 transitions, 2662 flow, removed 55 selfloop flow, removed 7 redundant places. [2024-06-04 16:39:07,921 INFO L231 Difference]: Finished difference. Result has 209 places, 198 transitions, 2293 flow [2024-06-04 16:39:07,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2224, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2293, PETRI_PLACES=209, PETRI_TRANSITIONS=198} [2024-06-04 16:39:07,921 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-04 16:39:07,921 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 198 transitions, 2293 flow [2024-06-04 16:39:07,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:39:07,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:07,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:07,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 16:39:07,922 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:07,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:07,922 INFO L85 PathProgramCache]: Analyzing trace with hash 116352244, now seen corresponding path program 5 times [2024-06-04 16:39:07,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931694897] [2024-06-04 16:39:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931694897] [2024-06-04 16:39:14,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931694897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:14,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:14,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:39:14,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294034447] [2024-06-04 16:39:14,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:14,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:39:14,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:39:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:39:14,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:39:14,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 198 transitions, 2293 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:39:14,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:14,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:39:14,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:15,000 INFO L124 PetriNetUnfolderBase]: 391/731 cut-off events. [2024-06-04 16:39:15,000 INFO L125 PetriNetUnfolderBase]: For 61955/61955 co-relation queries the response was YES. [2024-06-04 16:39:15,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6053 conditions, 731 events. 391/731 cut-off events. For 61955/61955 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3548 event pairs, 37 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5954. Up to 609 conditions per place. [2024-06-04 16:39:15,007 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 177 selfloop transitions, 28 changer transitions 0/208 dead transitions. [2024-06-04 16:39:15,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 208 transitions, 2736 flow [2024-06-04 16:39:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:39:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:39:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-04 16:39:15,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2024-06-04 16:39:15,008 INFO L175 Difference]: Start difference. First operand has 209 places, 198 transitions, 2293 flow. Second operand 9 states and 110 transitions. [2024-06-04 16:39:15,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 208 transitions, 2736 flow [2024-06-04 16:39:15,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 208 transitions, 2642 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 16:39:15,128 INFO L231 Difference]: Finished difference. Result has 209 places, 199 transitions, 2272 flow [2024-06-04 16:39:15,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2272, PETRI_PLACES=209, PETRI_TRANSITIONS=199} [2024-06-04 16:39:15,129 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-04 16:39:15,129 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 199 transitions, 2272 flow [2024-06-04 16:39:15,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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) [2024-06-04 16:39:15,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:15,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:15,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 16:39:15,130 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:15,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:15,130 INFO L85 PathProgramCache]: Analyzing trace with hash -706498798, now seen corresponding path program 2 times [2024-06-04 16:39:15,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:15,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6049956] [2024-06-04 16:39:15,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:23,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:23,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6049956] [2024-06-04 16:39:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6049956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:23,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:23,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:39:23,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236642659] [2024-06-04 16:39:23,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:23,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:39:23,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:23,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:39:23,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:39:23,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:39:23,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 199 transitions, 2272 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:39:23,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:23,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:39:23,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:24,005 INFO L124 PetriNetUnfolderBase]: 395/739 cut-off events. [2024-06-04 16:39:24,005 INFO L125 PetriNetUnfolderBase]: For 64105/64105 co-relation queries the response was YES. [2024-06-04 16:39:24,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 739 events. 395/739 cut-off events. For 64105/64105 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3595 event pairs, 32 based on Foata normal form. 2/737 useless extension candidates. Maximal degree in co-relation 6017. Up to 649 conditions per place. [2024-06-04 16:39:24,011 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 186 selfloop transitions, 21 changer transitions 0/210 dead transitions. [2024-06-04 16:39:24,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 210 transitions, 2734 flow [2024-06-04 16:39:24,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:39:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:39:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-04 16:39:24,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.365625 [2024-06-04 16:39:24,012 INFO L175 Difference]: Start difference. First operand has 209 places, 199 transitions, 2272 flow. Second operand 10 states and 117 transitions. [2024-06-04 16:39:24,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 210 transitions, 2734 flow [2024-06-04 16:39:24,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 2605 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 16:39:24,142 INFO L231 Difference]: Finished difference. Result has 211 places, 200 transitions, 2217 flow [2024-06-04 16:39:24,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2143, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2217, PETRI_PLACES=211, PETRI_TRANSITIONS=200} [2024-06-04 16:39:24,143 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-04 16:39:24,143 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 200 transitions, 2217 flow [2024-06-04 16:39:24,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:39:24,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:24,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:24,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 16:39:24,143 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:24,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1795466436, now seen corresponding path program 3 times [2024-06-04 16:39:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437860439] [2024-06-04 16:39:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437860439] [2024-06-04 16:39:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437860439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:39:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932534263] [2024-06-04 16:39:32,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:32,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:39:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:32,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:39:32,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:39:32,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:39:32,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 200 transitions, 2217 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:39:32,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:32,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:39:32,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:33,204 INFO L124 PetriNetUnfolderBase]: 402/749 cut-off events. [2024-06-04 16:39:33,204 INFO L125 PetriNetUnfolderBase]: For 65975/65975 co-relation queries the response was YES. [2024-06-04 16:39:33,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6140 conditions, 749 events. 402/749 cut-off events. For 65975/65975 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 3645 event pairs, 34 based on Foata normal form. 2/749 useless extension candidates. Maximal degree in co-relation 6039. Up to 678 conditions per place. [2024-06-04 16:39:33,211 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 195 selfloop transitions, 15 changer transitions 0/213 dead transitions. [2024-06-04 16:39:33,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 213 transitions, 2701 flow [2024-06-04 16:39:33,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:39:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:39:33,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:39:33,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 16:39:33,213 INFO L175 Difference]: Start difference. First operand has 211 places, 200 transitions, 2217 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:39:33,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 213 transitions, 2701 flow [2024-06-04 16:39:33,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 2618 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-04 16:39:33,349 INFO L231 Difference]: Finished difference. Result has 213 places, 203 transitions, 2219 flow [2024-06-04 16:39:33,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2219, PETRI_PLACES=213, PETRI_TRANSITIONS=203} [2024-06-04 16:39:33,349 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-04 16:39:33,349 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 203 transitions, 2219 flow [2024-06-04 16:39:33,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:39:33,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:33,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:33,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 16:39:33,350 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:33,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:33,350 INFO L85 PathProgramCache]: Analyzing trace with hash -706738366, now seen corresponding path program 9 times [2024-06-04 16:39:33,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:33,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109142323] [2024-06-04 16:39:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:33,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:41,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:41,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109142323] [2024-06-04 16:39:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109142323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:41,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:39:41,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52689104] [2024-06-04 16:39:41,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:41,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:39:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:39:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:39:41,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:39:41,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 203 transitions, 2219 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:39:41,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:41,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:39:41,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:42,253 INFO L124 PetriNetUnfolderBase]: 444/829 cut-off events. [2024-06-04 16:39:42,253 INFO L125 PetriNetUnfolderBase]: For 85563/85563 co-relation queries the response was YES. [2024-06-04 16:39:42,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7421 conditions, 829 events. 444/829 cut-off events. For 85563/85563 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4150 event pairs, 38 based on Foata normal form. 2/826 useless extension candidates. Maximal degree in co-relation 7319. Up to 609 conditions per place. [2024-06-04 16:39:42,261 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 176 selfloop transitions, 50 changer transitions 0/229 dead transitions. [2024-06-04 16:39:42,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 229 transitions, 3479 flow [2024-06-04 16:39:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:39:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:39:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 145 transitions. [2024-06-04 16:39:42,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-04 16:39:42,262 INFO L175 Difference]: Start difference. First operand has 213 places, 203 transitions, 2219 flow. Second operand 10 states and 145 transitions. [2024-06-04 16:39:42,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 229 transitions, 3479 flow [2024-06-04 16:39:42,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 229 transitions, 3426 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:39:42,406 INFO L231 Difference]: Finished difference. Result has 217 places, 214 transitions, 2597 flow [2024-06-04 16:39:42,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2597, PETRI_PLACES=217, PETRI_TRANSITIONS=214} [2024-06-04 16:39:42,407 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 186 predicate places. [2024-06-04 16:39:42,407 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 214 transitions, 2597 flow [2024-06-04 16:39:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:39:42,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:42,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:42,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 16:39:42,407 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:42,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:42,407 INFO L85 PathProgramCache]: Analyzing trace with hash 344677412, now seen corresponding path program 4 times [2024-06-04 16:39:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192464490] [2024-06-04 16:39:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:42,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:39:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:39:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:39:50,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192464490] [2024-06-04 16:39:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192464490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:39:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:39:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:39:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898418967] [2024-06-04 16:39:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:39:50,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:39:50,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:39:50,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:39:50,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:39:50,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:39:50,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 214 transitions, 2597 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 16:39:50,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:39:50,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:39:50,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:39:50,833 INFO L124 PetriNetUnfolderBase]: 448/837 cut-off events. [2024-06-04 16:39:50,833 INFO L125 PetriNetUnfolderBase]: For 88830/88830 co-relation queries the response was YES. [2024-06-04 16:39:50,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 837 events. 448/837 cut-off events. For 88830/88830 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 4207 event pairs, 36 based on Foata normal form. 2/835 useless extension candidates. Maximal degree in co-relation 7537. Up to 702 conditions per place. [2024-06-04 16:39:50,841 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 185 selfloop transitions, 36 changer transitions 0/224 dead transitions. [2024-06-04 16:39:50,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 3089 flow [2024-06-04 16:39:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 16:39:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 16:39:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 16:39:50,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923611111111111 [2024-06-04 16:39:50,842 INFO L175 Difference]: Start difference. First operand has 217 places, 214 transitions, 2597 flow. Second operand 9 states and 113 transitions. [2024-06-04 16:39:50,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 3089 flow [2024-06-04 16:39:51,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 224 transitions, 2936 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-04 16:39:51,010 INFO L231 Difference]: Finished difference. Result has 222 places, 215 transitions, 2552 flow [2024-06-04 16:39:51,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2444, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2552, PETRI_PLACES=222, PETRI_TRANSITIONS=215} [2024-06-04 16:39:51,010 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 191 predicate places. [2024-06-04 16:39:51,010 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 215 transitions, 2552 flow [2024-06-04 16:39:51,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 16:39:51,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:39:51,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:39:51,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 16:39:51,011 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:39:51,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:39:51,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1091604292, now seen corresponding path program 4 times [2024-06-04 16:39:51,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:39:51,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433572274] [2024-06-04 16:39:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:39:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:39:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:03,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:03,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433572274] [2024-06-04 16:40:03,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433572274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:03,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:03,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613596806] [2024-06-04 16:40:03,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:03,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:03,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:03,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:03,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:04,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:04,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 215 transitions, 2552 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:04,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:04,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:04,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:04,785 INFO L124 PetriNetUnfolderBase]: 456/849 cut-off events. [2024-06-04 16:40:04,785 INFO L125 PetriNetUnfolderBase]: For 90407/90407 co-relation queries the response was YES. [2024-06-04 16:40:04,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7696 conditions, 849 events. 456/849 cut-off events. For 90407/90407 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4290 event pairs, 35 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 7590. Up to 763 conditions per place. [2024-06-04 16:40:04,793 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 207 selfloop transitions, 19 changer transitions 0/229 dead transitions. [2024-06-04 16:40:04,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 229 transitions, 3250 flow [2024-06-04 16:40:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-04 16:40:04,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36875 [2024-06-04 16:40:04,794 INFO L175 Difference]: Start difference. First operand has 222 places, 215 transitions, 2552 flow. Second operand 10 states and 118 transitions. [2024-06-04 16:40:04,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 229 transitions, 3250 flow [2024-06-04 16:40:04,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 3152 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 16:40:04,976 INFO L231 Difference]: Finished difference. Result has 225 places, 219 transitions, 2585 flow [2024-06-04 16:40:04,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2454, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=219} [2024-06-04 16:40:04,976 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2024-06-04 16:40:04,976 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 219 transitions, 2585 flow [2024-06-04 16:40:04,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:04,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:04,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:04,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 16:40:04,977 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:04,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:04,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1344926508, now seen corresponding path program 10 times [2024-06-04 16:40:04,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:04,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601705235] [2024-06-04 16:40:04,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:04,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601705235] [2024-06-04 16:40:14,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601705235] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:14,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:14,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:40:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945980498] [2024-06-04 16:40:14,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:14,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:40:14,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:14,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:40:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:40:14,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:40:14,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 219 transitions, 2585 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:40:14,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:14,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:40:14,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:15,136 INFO L124 PetriNetUnfolderBase]: 477/888 cut-off events. [2024-06-04 16:40:15,136 INFO L125 PetriNetUnfolderBase]: For 103167/103167 co-relation queries the response was YES. [2024-06-04 16:40:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8335 conditions, 888 events. 477/888 cut-off events. For 103167/103167 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4532 event pairs, 42 based on Foata normal form. 2/885 useless extension candidates. Maximal degree in co-relation 8228. Up to 434 conditions per place. [2024-06-04 16:40:15,144 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 138 selfloop transitions, 103 changer transitions 0/244 dead transitions. [2024-06-04 16:40:15,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 244 transitions, 4015 flow [2024-06-04 16:40:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-04 16:40:15,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465625 [2024-06-04 16:40:15,146 INFO L175 Difference]: Start difference. First operand has 225 places, 219 transitions, 2585 flow. Second operand 10 states and 149 transitions. [2024-06-04 16:40:15,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 244 transitions, 4015 flow [2024-06-04 16:40:15,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 244 transitions, 3961 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:15,345 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 3030 flow [2024-06-04 16:40:15,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2531, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3030, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2024-06-04 16:40:15,346 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 198 predicate places. [2024-06-04 16:40:15,346 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 3030 flow [2024-06-04 16:40:15,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:40:15,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:15,347 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:15,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 16:40:15,347 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:15,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:15,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1049342190, now seen corresponding path program 5 times [2024-06-04 16:40:15,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:15,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936692865] [2024-06-04 16:40:15,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:15,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:26,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:26,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936692865] [2024-06-04 16:40:26,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936692865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:26,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:26,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513573705] [2024-06-04 16:40:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:26,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:26,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:26,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:26,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:26,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:26,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 3030 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:26,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:26,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:27,458 INFO L124 PetriNetUnfolderBase]: 481/895 cut-off events. [2024-06-04 16:40:27,459 INFO L125 PetriNetUnfolderBase]: For 108044/108044 co-relation queries the response was YES. [2024-06-04 16:40:27,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 895 events. 481/895 cut-off events. For 108044/108044 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4604 event pairs, 34 based on Foata normal form. 2/895 useless extension candidates. Maximal degree in co-relation 8597. Up to 780 conditions per place. [2024-06-04 16:40:27,468 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 218 selfloop transitions, 21 changer transitions 0/242 dead transitions. [2024-06-04 16:40:27,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 242 transitions, 3712 flow [2024-06-04 16:40:27,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:40:27,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:40:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-04 16:40:27,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36079545454545453 [2024-06-04 16:40:27,470 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 3030 flow. Second operand 11 states and 127 transitions. [2024-06-04 16:40:27,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 242 transitions, 3712 flow [2024-06-04 16:40:27,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 242 transitions, 3398 flow, removed 74 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:27,680 INFO L231 Difference]: Finished difference. Result has 234 places, 229 transitions, 2794 flow [2024-06-04 16:40:27,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2716, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2794, PETRI_PLACES=234, PETRI_TRANSITIONS=229} [2024-06-04 16:40:27,680 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 203 predicate places. [2024-06-04 16:40:27,681 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 229 transitions, 2794 flow [2024-06-04 16:40:27,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:27,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:27,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:27,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 16:40:27,681 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:27,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1059826390, now seen corresponding path program 5 times [2024-06-04 16:40:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955944662] [2024-06-04 16:40:27,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:27,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:37,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:37,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955944662] [2024-06-04 16:40:37,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955944662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:37,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62614070] [2024-06-04 16:40:37,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:37,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:37,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 229 transitions, 2794 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:37,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:37,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:37,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:37,680 INFO L124 PetriNetUnfolderBase]: 479/892 cut-off events. [2024-06-04 16:40:37,680 INFO L125 PetriNetUnfolderBase]: For 101861/101861 co-relation queries the response was YES. [2024-06-04 16:40:37,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8212 conditions, 892 events. 479/892 cut-off events. For 101861/101861 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4582 event pairs, 37 based on Foata normal form. 1/891 useless extension candidates. Maximal degree in co-relation 8103. Up to 809 conditions per place. [2024-06-04 16:40:37,688 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 219 selfloop transitions, 16 changer transitions 0/238 dead transitions. [2024-06-04 16:40:37,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 3284 flow [2024-06-04 16:40:37,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:37,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:37,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:40:37,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 16:40:37,690 INFO L175 Difference]: Start difference. First operand has 234 places, 229 transitions, 2794 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:40:37,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 3284 flow [2024-06-04 16:40:37,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 238 transitions, 3193 flow, removed 32 selfloop flow, removed 7 redundant places. [2024-06-04 16:40:37,881 INFO L231 Difference]: Finished difference. Result has 237 places, 229 transitions, 2740 flow [2024-06-04 16:40:37,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2703, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2740, PETRI_PLACES=237, PETRI_TRANSITIONS=229} [2024-06-04 16:40:37,882 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 206 predicate places. [2024-06-04 16:40:37,882 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 229 transitions, 2740 flow [2024-06-04 16:40:37,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:37,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:37,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:37,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 16:40:37,882 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:37,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:37,883 INFO L85 PathProgramCache]: Analyzing trace with hash -713000986, now seen corresponding path program 11 times [2024-06-04 16:40:37,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:37,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276357340] [2024-06-04 16:40:37,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:37,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:44,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:44,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276357340] [2024-06-04 16:40:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276357340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:44,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8701540] [2024-06-04 16:40:44,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:44,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:44,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:44,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:44,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 229 transitions, 2740 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:44,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:44,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:44,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:45,446 INFO L124 PetriNetUnfolderBase]: 487/910 cut-off events. [2024-06-04 16:40:45,446 INFO L125 PetriNetUnfolderBase]: For 107330/107330 co-relation queries the response was YES. [2024-06-04 16:40:45,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8383 conditions, 910 events. 487/910 cut-off events. For 107330/107330 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 4728 event pairs, 41 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 8273. Up to 738 conditions per place. [2024-06-04 16:40:45,455 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 200 selfloop transitions, 42 changer transitions 0/245 dead transitions. [2024-06-04 16:40:45,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 3686 flow [2024-06-04 16:40:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-04 16:40:45,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 16:40:45,456 INFO L175 Difference]: Start difference. First operand has 237 places, 229 transitions, 2740 flow. Second operand 10 states and 128 transitions. [2024-06-04 16:40:45,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 3686 flow [2024-06-04 16:40:45,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 245 transitions, 3631 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 16:40:45,677 INFO L231 Difference]: Finished difference. Result has 238 places, 234 transitions, 2918 flow [2024-06-04 16:40:45,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2691, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2918, PETRI_PLACES=238, PETRI_TRANSITIONS=234} [2024-06-04 16:40:45,678 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 207 predicate places. [2024-06-04 16:40:45,678 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 234 transitions, 2918 flow [2024-06-04 16:40:45,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:45,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:45,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:45,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 16:40:45,678 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:45,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1803756084, now seen corresponding path program 12 times [2024-06-04 16:40:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:45,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646774676] [2024-06-04 16:40:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:45,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:40:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:40:54,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:40:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646774676] [2024-06-04 16:40:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646774676] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:40:54,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:40:54,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:40:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267911020] [2024-06-04 16:40:54,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:40:54,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:40:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:40:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:40:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:40:54,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:40:54,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 234 transitions, 2918 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:54,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:40:54,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:40:54,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:40:55,096 INFO L124 PetriNetUnfolderBase]: 490/917 cut-off events. [2024-06-04 16:40:55,096 INFO L125 PetriNetUnfolderBase]: For 111186/111186 co-relation queries the response was YES. [2024-06-04 16:40:55,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8526 conditions, 917 events. 490/917 cut-off events. For 111186/111186 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 4781 event pairs, 39 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 8415. Up to 616 conditions per place. [2024-06-04 16:40:55,104 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 162 selfloop transitions, 91 changer transitions 0/256 dead transitions. [2024-06-04 16:40:55,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 256 transitions, 4043 flow [2024-06-04 16:40:55,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:40:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:40:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:40:55,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 16:40:55,106 INFO L175 Difference]: Start difference. First operand has 238 places, 234 transitions, 2918 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:40:55,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 256 transitions, 4043 flow [2024-06-04 16:40:55,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 256 transitions, 3920 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-04 16:40:55,308 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 3360 flow [2024-06-04 16:40:55,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2800, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3360, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2024-06-04 16:40:55,308 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 213 predicate places. [2024-06-04 16:40:55,308 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 3360 flow [2024-06-04 16:40:55,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:40:55,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:40:55,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:40:55,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 16:40:55,309 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:40:55,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:40:55,309 INFO L85 PathProgramCache]: Analyzing trace with hash -706499108, now seen corresponding path program 6 times [2024-06-04 16:40:55,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:40:55,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570067999] [2024-06-04 16:40:55,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:40:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:40:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:03,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:03,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570067999] [2024-06-04 16:41:03,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570067999] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:03,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:03,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:41:03,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099487665] [2024-06-04 16:41:03,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:03,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:41:03,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:41:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:41:03,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:41:03,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 3360 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:03,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:03,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:41:03,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:04,051 INFO L124 PetriNetUnfolderBase]: 493/920 cut-off events. [2024-06-04 16:41:04,051 INFO L125 PetriNetUnfolderBase]: For 114207/114207 co-relation queries the response was YES. [2024-06-04 16:41:04,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 920 events. 493/920 cut-off events. For 114207/114207 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4792 event pairs, 40 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 8763. Up to 740 conditions per place. [2024-06-04 16:41:04,060 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 204 selfloop transitions, 50 changer transitions 0/257 dead transitions. [2024-06-04 16:41:04,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 4090 flow [2024-06-04 16:41:04,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:04,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:41:04,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 16:41:04,061 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 3360 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:41:04,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 4090 flow [2024-06-04 16:41:04,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 257 transitions, 3980 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-04 16:41:04,268 INFO L231 Difference]: Finished difference. Result has 249 places, 247 transitions, 3403 flow [2024-06-04 16:41:04,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3250, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3403, PETRI_PLACES=249, PETRI_TRANSITIONS=247} [2024-06-04 16:41:04,268 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-04 16:41:04,268 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 247 transitions, 3403 flow [2024-06-04 16:41:04,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:04,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:04,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:04,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 16:41:04,269 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:04,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 116536694, now seen corresponding path program 13 times [2024-06-04 16:41:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906504420] [2024-06-04 16:41:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:13,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906504420] [2024-06-04 16:41:13,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906504420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:13,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:13,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69968659] [2024-06-04 16:41:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:13,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:13,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:13,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:13,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:41:13,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 247 transitions, 3403 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 16:41:13,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:13,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:41:13,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:13,834 INFO L124 PetriNetUnfolderBase]: 491/919 cut-off events. [2024-06-04 16:41:13,834 INFO L125 PetriNetUnfolderBase]: For 114902/114902 co-relation queries the response was YES. [2024-06-04 16:41:13,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 919 events. 491/919 cut-off events. For 114902/114902 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4798 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8706. Up to 763 conditions per place. [2024-06-04 16:41:13,843 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 216 selfloop transitions, 37 changer transitions 0/256 dead transitions. [2024-06-04 16:41:13,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 256 transitions, 3929 flow [2024-06-04 16:41:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:41:13,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 16:41:13,844 INFO L175 Difference]: Start difference. First operand has 249 places, 247 transitions, 3403 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:41:13,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 256 transitions, 3929 flow [2024-06-04 16:41:14,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 256 transitions, 3709 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:14,052 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 3262 flow [2024-06-04 16:41:14,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3183, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3262, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-06-04 16:41:14,053 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 219 predicate places. [2024-06-04 16:41:14,053 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 3262 flow [2024-06-04 16:41:14,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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) [2024-06-04 16:41:14,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:14,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:14,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 16:41:14,054 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:14,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:14,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1345156900, now seen corresponding path program 7 times [2024-06-04 16:41:14,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:14,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389368930] [2024-06-04 16:41:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389368930] [2024-06-04 16:41:21,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389368930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:41:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756588483] [2024-06-04 16:41:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:21,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:41:21,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:21,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:41:21,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:41:21,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:41:21,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 3262 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:21,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:21,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:41:21,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:22,291 INFO L124 PetriNetUnfolderBase]: 489/916 cut-off events. [2024-06-04 16:41:22,291 INFO L125 PetriNetUnfolderBase]: For 114186/114186 co-relation queries the response was YES. [2024-06-04 16:41:22,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 916 events. 489/916 cut-off events. For 114186/114186 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4776 event pairs, 38 based on Foata normal form. 1/912 useless extension candidates. Maximal degree in co-relation 8477. Up to 683 conditions per place. [2024-06-04 16:41:22,300 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 184 selfloop transitions, 69 changer transitions 0/256 dead transitions. [2024-06-04 16:41:22,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 256 transitions, 3788 flow [2024-06-04 16:41:22,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:41:22,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 16:41:22,302 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 3262 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:41:22,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 256 transitions, 3788 flow [2024-06-04 16:41:22,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 256 transitions, 3626 flow, removed 40 selfloop flow, removed 8 redundant places. [2024-06-04 16:41:22,509 INFO L231 Difference]: Finished difference. Result has 252 places, 247 transitions, 3243 flow [2024-06-04 16:41:22,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3100, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3243, PETRI_PLACES=252, PETRI_TRANSITIONS=247} [2024-06-04 16:41:22,510 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 221 predicate places. [2024-06-04 16:41:22,510 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 247 transitions, 3243 flow [2024-06-04 16:41:22,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:22,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:22,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:22,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 16:41:22,511 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:22,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1345157148, now seen corresponding path program 14 times [2024-06-04 16:41:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425159054] [2024-06-04 16:41:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:22,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425159054] [2024-06-04 16:41:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425159054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:29,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138407909] [2024-06-04 16:41:29,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:29,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:29,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:29,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:41:29,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 247 transitions, 3243 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:41:29,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:29,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:41:29,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:30,318 INFO L124 PetriNetUnfolderBase]: 490/920 cut-off events. [2024-06-04 16:41:30,318 INFO L125 PetriNetUnfolderBase]: For 115421/115421 co-relation queries the response was YES. [2024-06-04 16:41:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8531 conditions, 920 events. 490/920 cut-off events. For 115421/115421 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4836 event pairs, 40 based on Foata normal form. 2/917 useless extension candidates. Maximal degree in co-relation 8414. Up to 454 conditions per place. [2024-06-04 16:41:30,326 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 139 selfloop transitions, 120 changer transitions 0/262 dead transitions. [2024-06-04 16:41:30,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 262 transitions, 4332 flow [2024-06-04 16:41:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:30,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-04 16:41:30,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-06-04 16:41:30,328 INFO L175 Difference]: Start difference. First operand has 252 places, 247 transitions, 3243 flow. Second operand 10 states and 146 transitions. [2024-06-04 16:41:30,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 262 transitions, 4332 flow [2024-06-04 16:41:30,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 262 transitions, 4185 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:30,575 INFO L231 Difference]: Finished difference. Result has 253 places, 250 transitions, 3417 flow [2024-06-04 16:41:30,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3096, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3417, PETRI_PLACES=253, PETRI_TRANSITIONS=250} [2024-06-04 16:41:30,575 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 222 predicate places. [2024-06-04 16:41:30,576 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 250 transitions, 3417 flow [2024-06-04 16:41:30,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:41:30,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:30,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:30,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 16:41:30,576 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:30,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash -706507478, now seen corresponding path program 8 times [2024-06-04 16:41:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045864243] [2024-06-04 16:41:30,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:30,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:40,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045864243] [2024-06-04 16:41:40,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045864243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:40,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:40,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:41:40,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764532588] [2024-06-04 16:41:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:40,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:41:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:40,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:41:40,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:41:41,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:41:41,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 250 transitions, 3417 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:41,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:41,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:41:41,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:41,440 INFO L124 PetriNetUnfolderBase]: 488/915 cut-off events. [2024-06-04 16:41:41,440 INFO L125 PetriNetUnfolderBase]: For 114170/114170 co-relation queries the response was YES. [2024-06-04 16:41:41,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8597 conditions, 915 events. 488/915 cut-off events. For 114170/114170 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4782 event pairs, 39 based on Foata normal form. 1/911 useless extension candidates. Maximal degree in co-relation 8479. Up to 750 conditions per place. [2024-06-04 16:41:41,449 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 214 selfloop transitions, 42 changer transitions 0/259 dead transitions. [2024-06-04 16:41:41,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 3949 flow [2024-06-04 16:41:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 16:41:41,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39375 [2024-06-04 16:41:41,450 INFO L175 Difference]: Start difference. First operand has 253 places, 250 transitions, 3417 flow. Second operand 10 states and 126 transitions. [2024-06-04 16:41:41,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 3949 flow [2024-06-04 16:41:41,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 259 transitions, 3624 flow, removed 42 selfloop flow, removed 8 redundant places. [2024-06-04 16:41:41,698 INFO L231 Difference]: Finished difference. Result has 255 places, 250 transitions, 3181 flow [2024-06-04 16:41:41,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3092, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3181, PETRI_PLACES=255, PETRI_TRANSITIONS=250} [2024-06-04 16:41:41,699 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 224 predicate places. [2024-06-04 16:41:41,699 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 250 transitions, 3181 flow [2024-06-04 16:41:41,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:41:41,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:41,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:41,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 16:41:41,699 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:41,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash -706507726, now seen corresponding path program 15 times [2024-06-04 16:41:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671624746] [2024-06-04 16:41:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:41:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:41:50,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:41:50,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671624746] [2024-06-04 16:41:50,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671624746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:41:50,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:41:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:41:50,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532346445] [2024-06-04 16:41:50,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:41:50,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:41:50,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:41:50,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:41:50,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:41:50,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:41:51,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 250 transitions, 3181 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:41:51,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:41:51,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:41:51,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:41:51,463 INFO L124 PetriNetUnfolderBase]: 486/912 cut-off events. [2024-06-04 16:41:51,464 INFO L125 PetriNetUnfolderBase]: For 111508/111508 co-relation queries the response was YES. [2024-06-04 16:41:51,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8208 conditions, 912 events. 486/912 cut-off events. For 111508/111508 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4778 event pairs, 38 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 8090. Up to 728 conditions per place. [2024-06-04 16:41:51,472 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 50 changer transitions 0/261 dead transitions. [2024-06-04 16:41:51,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 261 transitions, 3910 flow [2024-06-04 16:41:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:41:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:41:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-04 16:41:51,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.428125 [2024-06-04 16:41:51,473 INFO L175 Difference]: Start difference. First operand has 255 places, 250 transitions, 3181 flow. Second operand 10 states and 137 transitions. [2024-06-04 16:41:51,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 261 transitions, 3910 flow [2024-06-04 16:41:51,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 261 transitions, 3788 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-06-04 16:41:51,713 INFO L231 Difference]: Finished difference. Result has 256 places, 251 transitions, 3193 flow [2024-06-04 16:41:51,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3059, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3193, PETRI_PLACES=256, PETRI_TRANSITIONS=251} [2024-06-04 16:41:51,713 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 225 predicate places. [2024-06-04 16:41:51,714 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 251 transitions, 3193 flow [2024-06-04 16:41:51,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:41:51,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:41:51,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:41:51,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 16:41:51,714 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:41:51,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:41:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash -706744876, now seen corresponding path program 16 times [2024-06-04 16:41:51,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:41:51,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471401423] [2024-06-04 16:41:51,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:41:51,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:41:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:01,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:01,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471401423] [2024-06-04 16:42:01,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471401423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:01,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:01,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171567381] [2024-06-04 16:42:01,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:01,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:01,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:01,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:01,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 251 transitions, 3193 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:01,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:01,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:01,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:02,290 INFO L124 PetriNetUnfolderBase]: 489/919 cut-off events. [2024-06-04 16:42:02,290 INFO L125 PetriNetUnfolderBase]: For 114898/114898 co-relation queries the response was YES. [2024-06-04 16:42:02,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8268 conditions, 919 events. 489/919 cut-off events. For 114898/114898 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4817 event pairs, 38 based on Foata normal form. 1/915 useless extension candidates. Maximal degree in co-relation 8150. Up to 685 conditions per place. [2024-06-04 16:42:02,302 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 197 selfloop transitions, 65 changer transitions 0/265 dead transitions. [2024-06-04 16:42:02,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 4289 flow [2024-06-04 16:42:02,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-04 16:42:02,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41875 [2024-06-04 16:42:02,304 INFO L175 Difference]: Start difference. First operand has 256 places, 251 transitions, 3193 flow. Second operand 10 states and 134 transitions. [2024-06-04 16:42:02,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 4289 flow [2024-06-04 16:42:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 265 transitions, 4055 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:02,550 INFO L231 Difference]: Finished difference. Result has 258 places, 253 transitions, 3148 flow [2024-06-04 16:42:02,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3148, PETRI_PLACES=258, PETRI_TRANSITIONS=253} [2024-06-04 16:42:02,551 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-04 16:42:02,551 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 253 transitions, 3148 flow [2024-06-04 16:42:02,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:02,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:02,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:02,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 16:42:02,552 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:02,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash -706738118, now seen corresponding path program 9 times [2024-06-04 16:42:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503613742] [2024-06-04 16:42:02,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:02,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:10,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503613742] [2024-06-04 16:42:10,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503613742] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:10,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:10,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682890330] [2024-06-04 16:42:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:10,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:10,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:10,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:10,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:10,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:10,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 253 transitions, 3148 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:10,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:10,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:10,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:10,748 INFO L124 PetriNetUnfolderBase]: 486/913 cut-off events. [2024-06-04 16:42:10,748 INFO L125 PetriNetUnfolderBase]: For 114115/114115 co-relation queries the response was YES. [2024-06-04 16:42:10,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8121 conditions, 913 events. 486/913 cut-off events. For 114115/114115 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4784 event pairs, 41 based on Foata normal form. 1/909 useless extension candidates. Maximal degree in co-relation 8002. Up to 714 conditions per place. [2024-06-04 16:42:10,755 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 212 selfloop transitions, 48 changer transitions 0/263 dead transitions. [2024-06-04 16:42:10,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 263 transitions, 3694 flow [2024-06-04 16:42:10,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-04 16:42:10,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2024-06-04 16:42:10,756 INFO L175 Difference]: Start difference. First operand has 258 places, 253 transitions, 3148 flow. Second operand 10 states and 129 transitions. [2024-06-04 16:42:10,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 263 transitions, 3694 flow [2024-06-04 16:42:11,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 3554 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 16:42:11,011 INFO L231 Difference]: Finished difference. Result has 262 places, 253 transitions, 3109 flow [2024-06-04 16:42:11,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3109, PETRI_PLACES=262, PETRI_TRANSITIONS=253} [2024-06-04 16:42:11,012 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 231 predicate places. [2024-06-04 16:42:11,012 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 253 transitions, 3109 flow [2024-06-04 16:42:11,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:11,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:11,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:11,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 16:42:11,013 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:11,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1795475364, now seen corresponding path program 17 times [2024-06-04 16:42:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:11,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41109551] [2024-06-04 16:42:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:11,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:19,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41109551] [2024-06-04 16:42:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41109551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:19,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924328434] [2024-06-04 16:42:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:19,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:19,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:19,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:19,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:19,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 253 transitions, 3109 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:19,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:19,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:19,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:20,349 INFO L124 PetriNetUnfolderBase]: 484/909 cut-off events. [2024-06-04 16:42:20,349 INFO L125 PetriNetUnfolderBase]: For 112718/112718 co-relation queries the response was YES. [2024-06-04 16:42:20,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7964 conditions, 909 events. 484/909 cut-off events. For 112718/112718 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4742 event pairs, 33 based on Foata normal form. 1/908 useless extension candidates. Maximal degree in co-relation 7844. Up to 819 conditions per place. [2024-06-04 16:42:20,358 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 243 selfloop transitions, 16 changer transitions 0/262 dead transitions. [2024-06-04 16:42:20,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 262 transitions, 3647 flow [2024-06-04 16:42:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:20,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 16:42:20,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.359375 [2024-06-04 16:42:20,360 INFO L175 Difference]: Start difference. First operand has 262 places, 253 transitions, 3109 flow. Second operand 10 states and 115 transitions. [2024-06-04 16:42:20,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 262 transitions, 3647 flow [2024-06-04 16:42:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 262 transitions, 3508 flow, removed 23 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:20,616 INFO L231 Difference]: Finished difference. Result has 264 places, 253 transitions, 3007 flow [2024-06-04 16:42:20,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3007, PETRI_PLACES=264, PETRI_TRANSITIONS=253} [2024-06-04 16:42:20,616 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-04 16:42:20,616 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 253 transitions, 3007 flow [2024-06-04 16:42:20,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:20,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:20,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:20,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 16:42:20,617 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:20,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1049698380, now seen corresponding path program 6 times [2024-06-04 16:42:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:20,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634240032] [2024-06-04 16:42:20,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:28,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:28,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:28,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634240032] [2024-06-04 16:42:28,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634240032] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:28,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:28,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 16:42:28,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834128983] [2024-06-04 16:42:28,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:28,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 16:42:28,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:28,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 16:42:28,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-04 16:42:28,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-06-04 16:42:28,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 253 transitions, 3007 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:42:28,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:28,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-06-04 16:42:28,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:28,956 INFO L124 PetriNetUnfolderBase]: 481/902 cut-off events. [2024-06-04 16:42:28,957 INFO L125 PetriNetUnfolderBase]: For 111002/111002 co-relation queries the response was YES. [2024-06-04 16:42:28,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7681 conditions, 902 events. 481/902 cut-off events. For 111002/111002 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4680 event pairs, 32 based on Foata normal form. 2/902 useless extension candidates. Maximal degree in co-relation 7560. Up to 805 conditions per place. [2024-06-04 16:42:28,965 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 242 selfloop transitions, 19 changer transitions 0/264 dead transitions. [2024-06-04 16:42:28,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 264 transitions, 3553 flow [2024-06-04 16:42:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-04 16:42:28,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38920454545454547 [2024-06-04 16:42:28,967 INFO L175 Difference]: Start difference. First operand has 264 places, 253 transitions, 3007 flow. Second operand 11 states and 137 transitions. [2024-06-04 16:42:28,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 264 transitions, 3553 flow [2024-06-04 16:42:29,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 264 transitions, 3494 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:29,214 INFO L231 Difference]: Finished difference. Result has 267 places, 253 transitions, 2990 flow [2024-06-04 16:42:29,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2948, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2990, PETRI_PLACES=267, PETRI_TRANSITIONS=253} [2024-06-04 16:42:29,215 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 236 predicate places. [2024-06-04 16:42:29,215 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 253 transitions, 2990 flow [2024-06-04 16:42:29,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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) [2024-06-04 16:42:29,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:29,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:29,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 16:42:29,216 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:29,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1795178446, now seen corresponding path program 10 times [2024-06-04 16:42:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033203966] [2024-06-04 16:42:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:38,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:38,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033203966] [2024-06-04 16:42:38,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033203966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:38,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205595858] [2024-06-04 16:42:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:38,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:38,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:38,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:38,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 253 transitions, 2990 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:38,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:38,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:38,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:39,159 INFO L124 PetriNetUnfolderBase]: 479/901 cut-off events. [2024-06-04 16:42:39,160 INFO L125 PetriNetUnfolderBase]: For 105940/105940 co-relation queries the response was YES. [2024-06-04 16:42:39,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7559 conditions, 901 events. 479/901 cut-off events. For 105940/105940 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4700 event pairs, 32 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 7437. Up to 796 conditions per place. [2024-06-04 16:42:39,168 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 236 selfloop transitions, 24 changer transitions 0/263 dead transitions. [2024-06-04 16:42:39,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 263 transitions, 3532 flow [2024-06-04 16:42:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 16:42:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 16:42:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2024-06-04 16:42:39,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-04 16:42:39,169 INFO L175 Difference]: Start difference. First operand has 267 places, 253 transitions, 2990 flow. Second operand 11 states and 128 transitions. [2024-06-04 16:42:39,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 263 transitions, 3532 flow [2024-06-04 16:42:39,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 263 transitions, 3417 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-06-04 16:42:39,454 INFO L231 Difference]: Finished difference. Result has 265 places, 253 transitions, 2928 flow [2024-06-04 16:42:39,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2928, PETRI_PLACES=265, PETRI_TRANSITIONS=253} [2024-06-04 16:42:39,455 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 234 predicate places. [2024-06-04 16:42:39,455 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 253 transitions, 2928 flow [2024-06-04 16:42:39,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:39,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:39,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:39,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 16:42:39,455 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:39,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash -635276989, now seen corresponding path program 1 times [2024-06-04 16:42:39,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:39,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012786001] [2024-06-04 16:42:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012786001] [2024-06-04 16:42:47,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012786001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029419915] [2024-06-04 16:42:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:47,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:47,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:47,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:47,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 253 transitions, 2928 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:47,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:47,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:47,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:48,322 INFO L124 PetriNetUnfolderBase]: 483/909 cut-off events. [2024-06-04 16:42:48,322 INFO L125 PetriNetUnfolderBase]: For 112040/112040 co-relation queries the response was YES. [2024-06-04 16:42:48,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7599 conditions, 909 events. 483/909 cut-off events. For 112040/112040 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 4753 event pairs, 13 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 7477. Up to 761 conditions per place. [2024-06-04 16:42:48,331 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 250 selfloop transitions, 20 changer transitions 0/273 dead transitions. [2024-06-04 16:42:48,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 273 transitions, 3544 flow [2024-06-04 16:42:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:42:48,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 16:42:48,333 INFO L175 Difference]: Start difference. First operand has 265 places, 253 transitions, 2928 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:42:48,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 273 transitions, 3544 flow [2024-06-04 16:42:48,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 273 transitions, 3461 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-04 16:42:48,606 INFO L231 Difference]: Finished difference. Result has 264 places, 254 transitions, 2917 flow [2024-06-04 16:42:48,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2845, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2917, PETRI_PLACES=264, PETRI_TRANSITIONS=254} [2024-06-04 16:42:48,606 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 233 predicate places. [2024-06-04 16:42:48,606 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 254 transitions, 2917 flow [2024-06-04 16:42:48,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:48,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:48,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:48,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 16:42:48,607 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:48,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1535897479, now seen corresponding path program 2 times [2024-06-04 16:42:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092078691] [2024-06-04 16:42:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:48,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:42:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:42:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:42:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092078691] [2024-06-04 16:42:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092078691] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:42:57,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:42:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:42:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812287657] [2024-06-04 16:42:57,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:42:57,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:42:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:42:57,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:42:57,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:42:58,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:42:58,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 254 transitions, 2917 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:58,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:42:58,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:42:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:42:58,690 INFO L124 PetriNetUnfolderBase]: 487/915 cut-off events. [2024-06-04 16:42:58,690 INFO L125 PetriNetUnfolderBase]: For 114753/114753 co-relation queries the response was YES. [2024-06-04 16:42:58,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 915 events. 487/915 cut-off events. For 114753/114753 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4780 event pairs, 27 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 7549. Up to 786 conditions per place. [2024-06-04 16:42:58,700 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 21 changer transitions 0/273 dead transitions. [2024-06-04 16:42:58,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 273 transitions, 3533 flow [2024-06-04 16:42:58,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:42:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:42:58,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:42:58,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 16:42:58,701 INFO L175 Difference]: Start difference. First operand has 264 places, 254 transitions, 2917 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:42:58,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 273 transitions, 3533 flow [2024-06-04 16:42:58,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 273 transitions, 3471 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 16:42:58,981 INFO L231 Difference]: Finished difference. Result has 266 places, 255 transitions, 2931 flow [2024-06-04 16:42:58,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2855, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2931, PETRI_PLACES=266, PETRI_TRANSITIONS=255} [2024-06-04 16:42:58,982 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2024-06-04 16:42:58,982 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 255 transitions, 2931 flow [2024-06-04 16:42:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:42:58,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:42:58,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:42:58,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 16:42:58,982 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:42:58,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:42:58,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1622737159, now seen corresponding path program 3 times [2024-06-04 16:42:58,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:42:58,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704812564] [2024-06-04 16:42:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:42:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:42:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:06,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:06,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:06,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704812564] [2024-06-04 16:43:06,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704812564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:06,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:06,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:06,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138200754] [2024-06-04 16:43:06,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:07,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:43:07,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 255 transitions, 2931 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:07,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:07,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:43:07,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:07,503 INFO L124 PetriNetUnfolderBase]: 491/923 cut-off events. [2024-06-04 16:43:07,504 INFO L125 PetriNetUnfolderBase]: For 119335/119335 co-relation queries the response was YES. [2024-06-04 16:43:07,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7737 conditions, 923 events. 491/923 cut-off events. For 119335/119335 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 4858 event pairs, 29 based on Foata normal form. 2/923 useless extension candidates. Maximal degree in co-relation 7614. Up to 799 conditions per place. [2024-06-04 16:43:07,513 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 248 selfloop transitions, 22 changer transitions 0/273 dead transitions. [2024-06-04 16:43:07,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 3547 flow [2024-06-04 16:43:07,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:07,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:07,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 16:43:07,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-04 16:43:07,516 INFO L175 Difference]: Start difference. First operand has 266 places, 255 transitions, 2931 flow. Second operand 10 states and 124 transitions. [2024-06-04 16:43:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 3547 flow [2024-06-04 16:43:07,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 273 transitions, 3481 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:07,786 INFO L231 Difference]: Finished difference. Result has 268 places, 256 transitions, 2945 flow [2024-06-04 16:43:07,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2865, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2945, PETRI_PLACES=268, PETRI_TRANSITIONS=256} [2024-06-04 16:43:07,787 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 237 predicate places. [2024-06-04 16:43:07,787 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 256 transitions, 2945 flow [2024-06-04 16:43:07,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:07,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:07,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:07,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 16:43:07,788 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:07,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:07,788 INFO L85 PathProgramCache]: Analyzing trace with hash 907158513, now seen corresponding path program 4 times [2024-06-04 16:43:07,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121170424] [2024-06-04 16:43:07,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:07,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:16,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:16,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121170424] [2024-06-04 16:43:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121170424] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:16,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:16,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190652336] [2024-06-04 16:43:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:16,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:16,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:43:16,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 256 transitions, 2945 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:16,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:16,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:43:16,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:16,819 INFO L124 PetriNetUnfolderBase]: 495/931 cut-off events. [2024-06-04 16:43:16,819 INFO L125 PetriNetUnfolderBase]: For 122092/122092 co-relation queries the response was YES. [2024-06-04 16:43:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 931 events. 495/931 cut-off events. For 122092/122092 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 4910 event pairs, 29 based on Foata normal form. 2/931 useless extension candidates. Maximal degree in co-relation 7679. Up to 804 conditions per place. [2024-06-04 16:43:16,829 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 243 selfloop transitions, 25 changer transitions 0/271 dead transitions. [2024-06-04 16:43:16,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 271 transitions, 3547 flow [2024-06-04 16:43:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:43:16,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 16:43:16,831 INFO L175 Difference]: Start difference. First operand has 268 places, 256 transitions, 2945 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:43:16,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 271 transitions, 3547 flow [2024-06-04 16:43:17,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 271 transitions, 3477 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:17,254 INFO L231 Difference]: Finished difference. Result has 270 places, 257 transitions, 2963 flow [2024-06-04 16:43:17,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2875, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2963, PETRI_PLACES=270, PETRI_TRANSITIONS=257} [2024-06-04 16:43:17,255 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 239 predicate places. [2024-06-04 16:43:17,255 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 257 transitions, 2963 flow [2024-06-04 16:43:17,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:17,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:17,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:17,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 16:43:17,256 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:17,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash 901796133, now seen corresponding path program 5 times [2024-06-04 16:43:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:17,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255730288] [2024-06-04 16:43:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:17,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:28,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:28,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255730288] [2024-06-04 16:43:28,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255730288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:28,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:28,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:28,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498502259] [2024-06-04 16:43:28,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:28,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:28,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:28,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:28,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:28,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:43:28,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 257 transitions, 2963 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:28,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:28,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:43:28,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:28,844 INFO L124 PetriNetUnfolderBase]: 499/939 cut-off events. [2024-06-04 16:43:28,844 INFO L125 PetriNetUnfolderBase]: For 124756/124756 co-relation queries the response was YES. [2024-06-04 16:43:28,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7872 conditions, 939 events. 499/939 cut-off events. For 124756/124756 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 4988 event pairs, 31 based on Foata normal form. 2/939 useless extension candidates. Maximal degree in co-relation 7747. Up to 820 conditions per place. [2024-06-04 16:43:28,854 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 246 selfloop transitions, 24 changer transitions 0/273 dead transitions. [2024-06-04 16:43:28,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 273 transitions, 3584 flow [2024-06-04 16:43:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-04 16:43:28,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378125 [2024-06-04 16:43:28,855 INFO L175 Difference]: Start difference. First operand has 270 places, 257 transitions, 2963 flow. Second operand 10 states and 121 transitions. [2024-06-04 16:43:28,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 273 transitions, 3584 flow [2024-06-04 16:43:29,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 273 transitions, 3504 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-04 16:43:29,142 INFO L231 Difference]: Finished difference. Result has 273 places, 259 transitions, 2989 flow [2024-06-04 16:43:29,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2885, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2989, PETRI_PLACES=273, PETRI_TRANSITIONS=259} [2024-06-04 16:43:29,142 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 242 predicate places. [2024-06-04 16:43:29,142 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 259 transitions, 2989 flow [2024-06-04 16:43:29,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:29,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:29,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:29,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 16:43:29,143 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:29,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:29,143 INFO L85 PathProgramCache]: Analyzing trace with hash 901648263, now seen corresponding path program 6 times [2024-06-04 16:43:29,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:29,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088135931] [2024-06-04 16:43:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 16:43:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 16:43:38,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 16:43:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088135931] [2024-06-04 16:43:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088135931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 16:43:38,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 16:43:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 16:43:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057800712] [2024-06-04 16:43:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 16:43:38,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 16:43:38,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 16:43:38,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 16:43:38,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-04 16:43:38,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2024-06-04 16:43:38,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 259 transitions, 2989 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:38,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 16:43:38,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2024-06-04 16:43:38,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 16:43:38,850 INFO L124 PetriNetUnfolderBase]: 503/947 cut-off events. [2024-06-04 16:43:38,850 INFO L125 PetriNetUnfolderBase]: For 127608/127608 co-relation queries the response was YES. [2024-06-04 16:43:38,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7939 conditions, 947 events. 503/947 cut-off events. For 127608/127608 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 5057 event pairs, 29 based on Foata normal form. 2/947 useless extension candidates. Maximal degree in co-relation 7812. Up to 805 conditions per place. [2024-06-04 16:43:38,860 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 249 selfloop transitions, 24 changer transitions 0/276 dead transitions. [2024-06-04 16:43:38,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 3613 flow [2024-06-04 16:43:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 16:43:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 16:43:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-04 16:43:38,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.384375 [2024-06-04 16:43:38,861 INFO L175 Difference]: Start difference. First operand has 273 places, 259 transitions, 2989 flow. Second operand 10 states and 123 transitions. [2024-06-04 16:43:38,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 3613 flow [2024-06-04 16:43:39,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 276 transitions, 3538 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 16:43:39,148 INFO L231 Difference]: Finished difference. Result has 276 places, 260 transitions, 3004 flow [2024-06-04 16:43:39,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2914, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3004, PETRI_PLACES=276, PETRI_TRANSITIONS=260} [2024-06-04 16:43:39,149 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 245 predicate places. [2024-06-04 16:43:39,149 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 260 transitions, 3004 flow [2024-06-04 16:43:39,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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) [2024-06-04 16:43:39,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 16:43:39,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 16:43:39,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-04 16:43:39,149 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 16:43:39,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 16:43:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 907164465, now seen corresponding path program 1 times [2024-06-04 16:43:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 16:43:39,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374271075] [2024-06-04 16:43:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 16:43:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 16:43:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15