./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.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/mix031.oepc.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/mix031.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.oepc.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 17:09:47,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:09:47,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:09:47,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:09:47,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:09:47,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:09:47,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:09:47,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:09:47,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:09:47,631 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:09:47,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:09:47,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:09:47,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:09:47,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:09:47,633 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:09:47,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:09:47,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:09:47,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:09:47,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:09:47,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:09:47,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:09:47,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:09:47,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:09:47,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:09:47,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:09:47,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:09:47,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:09:47,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:09:47,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:09:47,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:09:47,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:09:47,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:09:47,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:09:47,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:09:47,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:09:47,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:09:47,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:09:47,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:09:47,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:09:47,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:09:47,643 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:09:47,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:09:47,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:09:47,643 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 17:09:47,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:09:47,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:09:47,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:09:47,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:09:47,831 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:09:47,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-04 17:09:49,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:09:49,236 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:09:49,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.oepc.i [2024-06-04 17:09:49,249 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85f516f1/5b58a40bbb424dbc832791287d189eb8/FLAG493ab37a4 [2024-06-04 17:09:49,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c85f516f1/5b58a40bbb424dbc832791287d189eb8 [2024-06-04 17:09:49,267 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:09:49,267 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:09:49,268 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/mix031.oepc.yml/witness.yml [2024-06-04 17:09:49,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:09:49,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:09:49,427 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:09:49,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:09:49,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:09:49,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:09:49" (1/2) ... [2024-06-04 17:09:49,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bc52d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:09:49, skipping insertion in model container [2024-06-04 17:09:49,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:09:49" (1/2) ... [2024-06-04 17:09:49,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@166a42a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:09:49, skipping insertion in model container [2024-06-04 17:09:49,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:09:49" (2/2) ... [2024-06-04 17:09:49,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28bc52d4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:49, skipping insertion in model container [2024-06-04 17:09:49,434 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:09:49" (2/2) ... [2024-06-04 17:09:49,434 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:09:49,513 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:09:49,514 INFO L97 edCorrectnessWitness]: Location invariant before [L831-L831] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:09:49,514 INFO L97 edCorrectnessWitness]: Location invariant before [L830-L830] (((((((((((((((((((! multithreaded || ((0 <= a$w_buff0 && a$w_buff0 <= 1) && (a$w_buff0 == 0 || a$w_buff0 == 1))) && (! multithreaded || a$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )a$flush_delayed) + (long long )weak$$choice2 >= 0LL && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )x >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )z >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )weak$$choice2 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )main$tmp_guard1 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )x >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )y >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )z >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )x >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )z >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )x >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )y >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )z >= 0LL) && (1LL - (long long )a$w_buff1) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$w_buff1) + (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 )a >= 0LL) && (long long )__unbuffered_cnt + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 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 )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a$w_buff1 >= 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 )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )a$flush_delayed >= 0LL) && (long long )a + (long long )a$mem_tmp >= 0LL) && (long long )a + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a + (long long )a$read_delayed >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff1 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )a$flush_delayed + (long long )a$mem_tmp >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed + (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$flush_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$flush_delayed + (long long )x >= 0LL) && (long long )a$flush_delayed + (long long )y >= 0LL) && (long long )a$flush_delayed + (long long )z >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$flush_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp + (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff1 >= 0LL) && (long long )a$mem_tmp + (long long )main$tmp_guard1 >= 0LL) && (long long )a$mem_tmp + (long long )x >= 0LL) && (long long )a$mem_tmp + (long long )y >= 0LL) && (long long )a$mem_tmp + (long long )z >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice0 >= 0LL) && (long long )a$mem_tmp + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )x >= 0LL) && (long long )a$r_buff0_thd0 + (long long )y >= 0LL) && (long long )a$r_buff0_thd0 + (long long )z >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )x >= 0LL) && (long long )a$r_buff0_thd2 + (long long )y >= 0LL) && (long long )a$r_buff0_thd2 + (long long )z >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )x >= 0LL) && (long long )a$r_buff1_thd0 + (long long )y >= 0LL) && (long long )a$r_buff1_thd0 + (long long )z >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )x >= 0LL) && (long long )a$r_buff1_thd2 + (long long )y >= 0LL) && (long long )a$r_buff1_thd2 + (long long )z >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )weak$$choice2 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff1 >= 0LL) && (long long )a$read_delayed + (long long )main$tmp_guard1 >= 0LL) && (long long )a$read_delayed + (long long )x >= 0LL) && (long long )a$read_delayed + (long long )y >= 0LL) && (long long )a$read_delayed + (long long )z >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice0 >= 0LL) && (long long )a$read_delayed + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff1 + (long long )x >= 0LL) && (long long )a$w_buff1 + (long long )y >= 0LL) && (long long )a$w_buff1 + (long long )z >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff1 + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 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 )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL + (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd2 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) - (long long )a$read_delayed >= 0LL) && (0LL - (long long )a$r_buff1_thd2) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff0_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff0_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd0) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$r_buff1_thd1) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$r_buff1_thd2) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$read_delayed) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$r_buff1_thd1 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff0_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff0 >= 0LL) && (2LL - (long long )a$r_buff1_thd1) - (long long )a$w_buff1 >= 0LL) && (2LL - (long long )a$w_buff0) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )a$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )a$read_delayed >= 0LL) && (long long )a - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a - (long long )a$read_delayed >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$flush_delayed - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$flush_delayed - (long long )a$read_delayed >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$mem_tmp - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$mem_tmp - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff1_thd0 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff1_thd2 - (long long )a$read_delayed >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL))) && (! multithreaded || a$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || a$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= a$mem_tmp) && 0 <= a$w_buff0) && 0 <= a$w_buff1) && 0 <= x) && 0 <= y) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && a$mem_tmp <= 1) && a$w_buff0 <= 1) && a$w_buff1 <= 1) && x <= 1) && y <= 1) && z <= 1) && a$flush_delayed == (_Bool)0) && a$r_buff0_thd0 == (_Bool)0) && a$r_buff0_thd2 == (_Bool)0) && a$r_buff1_thd0 == (_Bool)0) && a$r_buff1_thd2 == (_Bool)0) && a$read_delayed == (_Bool)0) && a$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)) && (a == 0 || a == 1)) && (a$mem_tmp == 0 || a$mem_tmp == 1)) && (a$w_buff0 == 0 || a$w_buff0 == 1)) && (a$w_buff1 == 0 || a$w_buff1 == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)))) && (! multithreaded || a$read_delayed_var == 0)) && (! multithreaded || a$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= a$w_buff1 && a$w_buff1 <= 1) && (a$w_buff1 == 0 || a$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || a$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || ((0 <= a$mem_tmp && a$mem_tmp <= 1) && (a$mem_tmp == 0 || a$mem_tmp == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-04 17:09:49,515 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:09:49,515 INFO L106 edCorrectnessWitness]: ghost_update [L828-L828] multithreaded = 1; [2024-06-04 17:09:49,554 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:09:49,857 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:09:49,864 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:09:50,115 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:09:50,156 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:09:50,156 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50 WrapperNode [2024-06-04 17:09:50,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:09:50,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:09:50,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:09:50,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:09:50,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,297 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-06-04 17:09:50,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:09:50,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:09:50,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:09:50,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:09:50,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,362 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 17:09:50,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,424 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,441 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:09:50,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:09:50,442 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:09:50,442 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:09:50,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (1/1) ... [2024-06-04 17:09:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:09:50,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:09:50,482 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 17:09:50,489 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 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:09:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:09:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:09:50,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:09:50,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:09:50,523 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 17:09:50,642 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:09:50,644 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:09:51,508 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:09:51,508 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:09:51,706 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:09:51,706 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:09:51,707 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:09:51 BoogieIcfgContainer [2024-06-04 17:09:51,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:09:51,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:09:51,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:09:51,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:09:51,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:09:49" (1/4) ... [2024-06-04 17:09:51,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857880a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:09:51, skipping insertion in model container [2024-06-04 17:09:51,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:09:49" (2/4) ... [2024-06-04 17:09:51,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857880a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:09:51, skipping insertion in model container [2024-06-04 17:09:51,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:09:50" (3/4) ... [2024-06-04 17:09:51,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6857880a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:09:51, skipping insertion in model container [2024-06-04 17:09:51,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:09:51" (4/4) ... [2024-06-04 17:09:51,713 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.oepc.i [2024-06-04 17:09:51,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:09:51,729 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 17:09:51,729 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:09:51,829 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:09:51,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 34 transitions, 76 flow [2024-06-04 17:09:51,886 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-06-04 17:09:51,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:09:51,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:09:51,888 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 34 transitions, 76 flow [2024-06-04 17:09:51,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 58 flow [2024-06-04 17:09:51,929 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:09:51,938 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;@1851e280, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:09:51,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 17:09:51,953 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:09:51,953 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-04 17:09:51,954 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:09:51,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:51,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:09:51,955 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 17:09:51,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1966790300, now seen corresponding path program 1 times [2024-06-04 17:09:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727159791] [2024-06-04 17:09:51,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:51,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:09:57,610 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 17:09:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:09:57,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727159791] [2024-06-04 17:09:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727159791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:09:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:09:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:09:57,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840480486] [2024-06-04 17:09:57,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:09:57,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:09:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:09:57,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:09:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:09:57,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-04 17:09:57,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 58 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 17:09:57,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:09:57,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-04 17:09:57,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:09:57,969 INFO L124 PetriNetUnfolderBase]: 189/360 cut-off events. [2024-06-04 17:09:57,969 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 17:09:57,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 360 events. 189/360 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1418 event pairs, 115 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 704. Up to 333 conditions per place. [2024-06-04 17:09:57,974 INFO L140 encePairwiseOnDemand]: 29/34 looper letters, 24 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-06-04 17:09:57,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 32 transitions, 127 flow [2024-06-04 17:09:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:09:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:09:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-06-04 17:09:57,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2024-06-04 17:09:57,985 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 58 flow. Second operand 3 states and 59 transitions. [2024-06-04 17:09:57,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 32 transitions, 127 flow [2024-06-04 17:09:57,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 32 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 17:09:57,989 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 77 flow [2024-06-04 17:09:57,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-04 17:09:57,994 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2024-06-04 17:09:57,994 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 77 flow [2024-06-04 17:09:57,994 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 17:09:57,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:09:57,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:09:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:09:57,995 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 17:09:57,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:09:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 299908411, now seen corresponding path program 1 times [2024-06-04 17:09:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:09:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776570199] [2024-06-04 17:09:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:09:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:09:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:02,171 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 17:10:02,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:02,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776570199] [2024-06-04 17:10:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776570199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:02,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:02,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:10:02,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956876223] [2024-06-04 17:10:02,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:02,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:10:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:02,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:10:02,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:10:02,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 34 [2024-06-04 17:10:02,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 17:10:02,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:02,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 34 [2024-06-04 17:10:02,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:02,543 INFO L124 PetriNetUnfolderBase]: 186/355 cut-off events. [2024-06-04 17:10:02,543 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-06-04 17:10:02,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 355 events. 186/355 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1411 event pairs, 94 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 784. Up to 319 conditions per place. [2024-06-04 17:10:02,546 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 28 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-04 17:10:02,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 169 flow [2024-06-04 17:10:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:10:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:10:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-06-04 17:10:02,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5514705882352942 [2024-06-04 17:10:02,549 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 77 flow. Second operand 4 states and 75 transitions. [2024-06-04 17:10:02,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 169 flow [2024-06-04 17:10:02,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:10:02,551 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 101 flow [2024-06-04 17:10:02,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2024-06-04 17:10:02,552 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-06-04 17:10:02,552 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 101 flow [2024-06-04 17:10:02,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 17:10:02,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:02,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:02,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:10:02,553 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 17:10:02,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:02,554 INFO L85 PathProgramCache]: Analyzing trace with hash 707227471, now seen corresponding path program 1 times [2024-06-04 17:10:02,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:02,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659952386] [2024-06-04 17:10:02,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:02,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:06,830 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 17:10:06,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:06,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659952386] [2024-06-04 17:10:06,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659952386] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:06,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:06,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:10:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382853240] [2024-06-04 17:10:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:06,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:10:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:06,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:10:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:10:06,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:10:06,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 17:10:06,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:06,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:10:06,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:07,224 INFO L124 PetriNetUnfolderBase]: 219/413 cut-off events. [2024-06-04 17:10:07,225 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-06-04 17:10:07,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1021 conditions, 413 events. 219/413 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1636 event pairs, 99 based on Foata normal form. 2/412 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. [2024-06-04 17:10:07,230 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 33 selfloop transitions, 7 changer transitions 0/44 dead transitions. [2024-06-04 17:10:07,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 219 flow [2024-06-04 17:10:07,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:10:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:10:07,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-04 17:10:07,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117647058823529 [2024-06-04 17:10:07,233 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 101 flow. Second operand 5 states and 87 transitions. [2024-06-04 17:10:07,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 219 flow [2024-06-04 17:10:07,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 210 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 17:10:07,235 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 125 flow [2024-06-04 17:10:07,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-04 17:10:07,236 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2024-06-04 17:10:07,236 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 125 flow [2024-06-04 17:10:07,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 17:10:07,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:07,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:07,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:10:07,237 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 17:10:07,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:07,237 INFO L85 PathProgramCache]: Analyzing trace with hash 449216474, now seen corresponding path program 1 times [2024-06-04 17:10:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076996841] [2024-06-04 17:10:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:11,041 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 17:10:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076996841] [2024-06-04 17:10:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076996841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:11,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:11,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:10:11,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989396176] [2024-06-04 17:10:11,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:11,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:10:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:11,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:10:11,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:10:11,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 34 [2024-06-04 17:10:11,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 17:10:11,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:11,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 34 [2024-06-04 17:10:11,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:11,506 INFO L124 PetriNetUnfolderBase]: 216/410 cut-off events. [2024-06-04 17:10:11,507 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-04 17:10:11,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 410 events. 216/410 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1612 event pairs, 78 based on Foata normal form. 2/408 useless extension candidates. Maximal degree in co-relation 1084. Up to 352 conditions per place. [2024-06-04 17:10:11,509 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2024-06-04 17:10:11,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 267 flow [2024-06-04 17:10:11,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:10:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:10:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-04 17:10:11,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-04 17:10:11,512 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 125 flow. Second operand 6 states and 102 transitions. [2024-06-04 17:10:11,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 267 flow [2024-06-04 17:10:11,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 50 transitions, 252 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 17:10:11,514 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 149 flow [2024-06-04 17:10:11,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2024-06-04 17:10:11,515 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2024-06-04 17:10:11,515 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 149 flow [2024-06-04 17:10:11,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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 17:10:11,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:11,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:11,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:10:11,516 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 17:10:11,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 198722588, now seen corresponding path program 1 times [2024-06-04 17:10:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780147768] [2024-06-04 17:10:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:20,519 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 17:10:20,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780147768] [2024-06-04 17:10:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780147768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:10:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855156289] [2024-06-04 17:10:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:10:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:20,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:10:20,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:10:20,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:10:20,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 17:10:20,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:20,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:10:20,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:20,993 INFO L124 PetriNetUnfolderBase]: 230/443 cut-off events. [2024-06-04 17:10:20,993 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2024-06-04 17:10:20,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 443 events. 230/443 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1732 event pairs, 100 based on Foata normal form. 1/444 useless extension candidates. Maximal degree in co-relation 1249. Up to 402 conditions per place. [2024-06-04 17:10:20,997 INFO L140 encePairwiseOnDemand]: 28/34 looper letters, 30 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-06-04 17:10:20,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 239 flow [2024-06-04 17:10:20,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:10:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:10:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2024-06-04 17:10:20,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2024-06-04 17:10:20,999 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 149 flow. Second operand 5 states and 72 transitions. [2024-06-04 17:10:20,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 239 flow [2024-06-04 17:10:21,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 218 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:10:21,001 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 155 flow [2024-06-04 17:10:21,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-04 17:10:21,002 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2024-06-04 17:10:21,003 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 155 flow [2024-06-04 17:10:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 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 17:10:21,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:21,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:21,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:10:21,004 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 17:10:21,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:21,004 INFO L85 PathProgramCache]: Analyzing trace with hash -420875807, now seen corresponding path program 1 times [2024-06-04 17:10:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445285755] [2024-06-04 17:10:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:25,634 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 17:10:25,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:25,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445285755] [2024-06-04 17:10:25,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445285755] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:25,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:25,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:10:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21814290] [2024-06-04 17:10:25,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:10:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:10:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:10:25,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:10:25,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 17:10:25,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:25,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:10:25,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:26,195 INFO L124 PetriNetUnfolderBase]: 244/454 cut-off events. [2024-06-04 17:10:26,195 INFO L125 PetriNetUnfolderBase]: For 839/839 co-relation queries the response was YES. [2024-06-04 17:10:26,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1369 conditions, 454 events. 244/454 cut-off events. For 839/839 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1735 event pairs, 61 based on Foata normal form. 2/456 useless extension candidates. Maximal degree in co-relation 1348. Up to 382 conditions per place. [2024-06-04 17:10:26,198 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 48 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-04 17:10:26,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 64 transitions, 355 flow [2024-06-04 17:10:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:10:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:10:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 17:10:26,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45955882352941174 [2024-06-04 17:10:26,200 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 155 flow. Second operand 8 states and 125 transitions. [2024-06-04 17:10:26,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 64 transitions, 355 flow [2024-06-04 17:10:26,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-04 17:10:26,202 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 204 flow [2024-06-04 17:10:26,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-06-04 17:10:26,203 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-06-04 17:10:26,203 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 204 flow [2024-06-04 17:10:26,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 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 17:10:26,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:26,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:26,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:10:26,204 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 17:10:26,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:26,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1846665422, now seen corresponding path program 1 times [2024-06-04 17:10:26,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:26,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735819947] [2024-06-04 17:10:26,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:26,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:35,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 17:10:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735819947] [2024-06-04 17:10:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735819947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:35,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:35,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:10:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366880377] [2024-06-04 17:10:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:35,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:10:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:10:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:10:35,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:10:35,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 204 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 17:10:35,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:35,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:10:35,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:36,253 INFO L124 PetriNetUnfolderBase]: 258/473 cut-off events. [2024-06-04 17:10:36,254 INFO L125 PetriNetUnfolderBase]: For 1313/1313 co-relation queries the response was YES. [2024-06-04 17:10:36,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 473 events. 258/473 cut-off events. For 1313/1313 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1789 event pairs, 71 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1575. Up to 449 conditions per place. [2024-06-04 17:10:36,257 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 36 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-04 17:10:36,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 314 flow [2024-06-04 17:10:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:10:36,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:10:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-06-04 17:10:36,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:10:36,259 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 204 flow. Second operand 6 states and 78 transitions. [2024-06-04 17:10:36,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 314 flow [2024-06-04 17:10:36,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 285 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:10:36,263 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 208 flow [2024-06-04 17:10:36,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-04 17:10:36,265 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-06-04 17:10:36,265 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 208 flow [2024-06-04 17:10:36,265 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 17:10:36,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:36,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:36,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:10:36,266 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 17:10:36,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:36,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1993595485, now seen corresponding path program 1 times [2024-06-04 17:10:36,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:36,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241276256] [2024-06-04 17:10:36,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:36,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:43,998 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 17:10:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241276256] [2024-06-04 17:10:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241276256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:44,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:10:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647251653] [2024-06-04 17:10:44,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:44,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:10:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:10:44,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:10:44,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:10:44,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 17:10:44,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:44,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:10:44,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:44,431 INFO L124 PetriNetUnfolderBase]: 244/461 cut-off events. [2024-06-04 17:10:44,431 INFO L125 PetriNetUnfolderBase]: For 1717/1717 co-relation queries the response was YES. [2024-06-04 17:10:44,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 461 events. 244/461 cut-off events. For 1717/1717 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1777 event pairs, 68 based on Foata normal form. 1/462 useless extension candidates. Maximal degree in co-relation 1595. Up to 399 conditions per place. [2024-06-04 17:10:44,434 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 39 selfloop transitions, 11 changer transitions 0/56 dead transitions. [2024-06-04 17:10:44,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 362 flow [2024-06-04 17:10:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:10:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:10:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2024-06-04 17:10:44,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4362745098039216 [2024-06-04 17:10:44,436 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 208 flow. Second operand 6 states and 89 transitions. [2024-06-04 17:10:44,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 362 flow [2024-06-04 17:10:44,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 17:10:44,438 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 238 flow [2024-06-04 17:10:44,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-04 17:10:44,439 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 20 predicate places. [2024-06-04 17:10:44,439 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 238 flow [2024-06-04 17:10:44,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 17:10:44,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:44,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:44,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:10:44,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 17:10:44,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash -162246683, now seen corresponding path program 1 times [2024-06-04 17:10:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:44,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519389768] [2024-06-04 17:10:44,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:44,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:49,451 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 17:10:49,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:49,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519389768] [2024-06-04 17:10:49,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519389768] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:49,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:49,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:10:49,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303466200] [2024-06-04 17:10:49,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:49,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:10:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:10:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:10:49,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:10:49,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 238 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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 17:10:49,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:49,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:10:49,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:50,143 INFO L124 PetriNetUnfolderBase]: 258/471 cut-off events. [2024-06-04 17:10:50,144 INFO L125 PetriNetUnfolderBase]: For 2159/2159 co-relation queries the response was YES. [2024-06-04 17:10:50,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 471 events. 258/471 cut-off events. For 2159/2159 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1748 event pairs, 45 based on Foata normal form. 4/475 useless extension candidates. Maximal degree in co-relation 1708. Up to 376 conditions per place. [2024-06-04 17:10:50,147 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 53 selfloop transitions, 14 changer transitions 0/71 dead transitions. [2024-06-04 17:10:50,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 424 flow [2024-06-04 17:10:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:10:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:10:50,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 134 transitions. [2024-06-04 17:10:50,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43790849673202614 [2024-06-04 17:10:50,149 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 238 flow. Second operand 9 states and 134 transitions. [2024-06-04 17:10:50,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 424 flow [2024-06-04 17:10:50,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 71 transitions, 414 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:10:50,151 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 248 flow [2024-06-04 17:10:50,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=248, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2024-06-04 17:10:50,153 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2024-06-04 17:10:50,153 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 248 flow [2024-06-04 17:10:50,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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 17:10:50,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:50,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:50,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:10:50,154 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 17:10:50,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:50,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1993862395, now seen corresponding path program 2 times [2024-06-04 17:10:50,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:50,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359192444] [2024-06-04 17:10:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:10:57,726 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 17:10:57,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:10:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359192444] [2024-06-04 17:10:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359192444] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:10:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:10:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:10:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278310348] [2024-06-04 17:10:57,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:10:57,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:10:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:10:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:10:57,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:10:57,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:10:57,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 17:10:57,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:10:57,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:10:57,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:10:58,167 INFO L124 PetriNetUnfolderBase]: 239/451 cut-off events. [2024-06-04 17:10:58,167 INFO L125 PetriNetUnfolderBase]: For 2534/2534 co-relation queries the response was YES. [2024-06-04 17:10:58,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 451 events. 239/451 cut-off events. For 2534/2534 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1707 event pairs, 64 based on Foata normal form. 1/452 useless extension candidates. Maximal degree in co-relation 1729. Up to 402 conditions per place. [2024-06-04 17:10:58,170 INFO L140 encePairwiseOnDemand]: 27/34 looper letters, 37 selfloop transitions, 8 changer transitions 0/51 dead transitions. [2024-06-04 17:10:58,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 352 flow [2024-06-04 17:10:58,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:10:58,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:10:58,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2024-06-04 17:10:58,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-04 17:10:58,171 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 248 flow. Second operand 6 states and 82 transitions. [2024-06-04 17:10:58,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 352 flow [2024-06-04 17:10:58,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 314 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 17:10:58,177 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 231 flow [2024-06-04 17:10:58,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2024-06-04 17:10:58,180 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2024-06-04 17:10:58,181 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 231 flow [2024-06-04 17:10:58,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 17:10:58,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:10:58,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:10:58,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:10:58,182 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 17:10:58,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:10:58,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1993872315, now seen corresponding path program 1 times [2024-06-04 17:10:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:10:58,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292912191] [2024-06-04 17:10:58,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:10:58,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:10:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:08,657 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 17:11:08,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:08,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292912191] [2024-06-04 17:11:08,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292912191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:08,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:08,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987681095] [2024-06-04 17:11:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:08,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:08,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:08,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:08,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:08,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:08,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 231 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 17:11:08,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:08,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:08,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:09,274 INFO L124 PetriNetUnfolderBase]: 250/459 cut-off events. [2024-06-04 17:11:09,275 INFO L125 PetriNetUnfolderBase]: For 2935/2935 co-relation queries the response was YES. [2024-06-04 17:11:09,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 459 events. 250/459 cut-off events. For 2935/2935 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1683 event pairs, 63 based on Foata normal form. 3/462 useless extension candidates. Maximal degree in co-relation 1748. Up to 425 conditions per place. [2024-06-04 17:11:09,278 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 42 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-06-04 17:11:09,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 365 flow [2024-06-04 17:11:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:09,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:09,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 17:11:09,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-04 17:11:09,279 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 231 flow. Second operand 7 states and 89 transitions. [2024-06-04 17:11:09,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 365 flow [2024-06-04 17:11:09,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 344 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-04 17:11:09,282 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 249 flow [2024-06-04 17:11:09,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-06-04 17:11:09,283 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 27 predicate places. [2024-06-04 17:11:09,283 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 249 flow [2024-06-04 17:11:09,283 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 17:11:09,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:09,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:09,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:11:09,283 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 17:11:09,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash 587341877, now seen corresponding path program 1 times [2024-06-04 17:11:09,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:09,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89685561] [2024-06-04 17:11:09,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:09,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:17,218 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 17:11:17,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:17,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89685561] [2024-06-04 17:11:17,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89685561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:17,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:17,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:17,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818443009] [2024-06-04 17:11:17,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:17,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:17,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:17,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:17,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 249 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 17:11:17,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:17,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:17,743 INFO L124 PetriNetUnfolderBase]: 253/464 cut-off events. [2024-06-04 17:11:17,744 INFO L125 PetriNetUnfolderBase]: For 3391/3391 co-relation queries the response was YES. [2024-06-04 17:11:17,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 464 events. 253/464 cut-off events. For 3391/3391 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1701 event pairs, 61 based on Foata normal form. 1/465 useless extension candidates. Maximal degree in co-relation 1843. Up to 396 conditions per place. [2024-06-04 17:11:17,746 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-06-04 17:11:17,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 65 transitions, 447 flow [2024-06-04 17:11:17,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 17:11:17,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40756302521008403 [2024-06-04 17:11:17,748 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 249 flow. Second operand 7 states and 97 transitions. [2024-06-04 17:11:17,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 65 transitions, 447 flow [2024-06-04 17:11:17,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 65 transitions, 424 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:11:17,752 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 287 flow [2024-06-04 17:11:17,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-04 17:11:17,752 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 29 predicate places. [2024-06-04 17:11:17,752 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 287 flow [2024-06-04 17:11:17,752 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 17:11:17,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:17,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:17,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:11:17,753 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 17:11:17,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 587521615, now seen corresponding path program 1 times [2024-06-04 17:11:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137714449] [2024-06-04 17:11:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:25,601 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 17:11:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:25,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137714449] [2024-06-04 17:11:25,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137714449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:25,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:25,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:25,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811758490] [2024-06-04 17:11:25,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:25,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:25,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:25,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:25,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:25,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:25,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 287 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 17:11:25,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:25,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:25,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:26,052 INFO L124 PetriNetUnfolderBase]: 260/473 cut-off events. [2024-06-04 17:11:26,053 INFO L125 PetriNetUnfolderBase]: For 3882/3882 co-relation queries the response was YES. [2024-06-04 17:11:26,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1977 conditions, 473 events. 260/473 cut-off events. For 3882/3882 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1727 event pairs, 63 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 1947. Up to 418 conditions per place. [2024-06-04 17:11:26,056 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 15 changer transitions 0/66 dead transitions. [2024-06-04 17:11:26,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 477 flow [2024-06-04 17:11:26,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:26,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:26,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-04 17:11:26,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-04 17:11:26,057 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 287 flow. Second operand 7 states and 95 transitions. [2024-06-04 17:11:26,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 477 flow [2024-06-04 17:11:26,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 66 transitions, 456 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:11:26,061 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 325 flow [2024-06-04 17:11:26,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=325, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-06-04 17:11:26,063 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 33 predicate places. [2024-06-04 17:11:26,063 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 325 flow [2024-06-04 17:11:26,063 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 17:11:26,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:26,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:26,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:11:26,063 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 17:11:26,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash 587521367, now seen corresponding path program 2 times [2024-06-04 17:11:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345416276] [2024-06-04 17:11:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:26,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:33,935 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 17:11:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345416276] [2024-06-04 17:11:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345416276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982674964] [2024-06-04 17:11:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:33,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:34,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:34,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 325 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 17:11:34,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:34,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:34,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:34,383 INFO L124 PetriNetUnfolderBase]: 261/476 cut-off events. [2024-06-04 17:11:34,383 INFO L125 PetriNetUnfolderBase]: For 4694/4694 co-relation queries the response was YES. [2024-06-04 17:11:34,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2105 conditions, 476 events. 261/476 cut-off events. For 4694/4694 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1748 event pairs, 60 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 2073. Up to 405 conditions per place. [2024-06-04 17:11:34,386 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 45 selfloop transitions, 17 changer transitions 0/68 dead transitions. [2024-06-04 17:11:34,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 513 flow [2024-06-04 17:11:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-04 17:11:34,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915966386554624 [2024-06-04 17:11:34,388 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 325 flow. Second operand 7 states and 95 transitions. [2024-06-04 17:11:34,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 513 flow [2024-06-04 17:11:34,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 497 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 17:11:34,392 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 360 flow [2024-06-04 17:11:34,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=360, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-06-04 17:11:34,393 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2024-06-04 17:11:34,393 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 360 flow [2024-06-04 17:11:34,393 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 17:11:34,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:34,393 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:34,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:11:34,394 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 17:11:34,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:34,394 INFO L85 PathProgramCache]: Analyzing trace with hash -872308357, now seen corresponding path program 3 times [2024-06-04 17:11:34,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:34,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84605336] [2024-06-04 17:11:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:42,248 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 17:11:42,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:42,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84605336] [2024-06-04 17:11:42,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84605336] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:42,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:42,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:42,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004754775] [2024-06-04 17:11:42,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:42,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:42,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:42,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 57 transitions, 360 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 17:11:42,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:42,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:42,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:42,793 INFO L124 PetriNetUnfolderBase]: 259/473 cut-off events. [2024-06-04 17:11:42,793 INFO L125 PetriNetUnfolderBase]: For 5312/5312 co-relation queries the response was YES. [2024-06-04 17:11:42,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2165 conditions, 473 events. 259/473 cut-off events. For 5312/5312 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1733 event pairs, 59 based on Foata normal form. 1/474 useless extension candidates. Maximal degree in co-relation 2131. Up to 430 conditions per place. [2024-06-04 17:11:42,797 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 48 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-04 17:11:42,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 492 flow [2024-06-04 17:11:42,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:42,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 17:11:42,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-04 17:11:42,798 INFO L175 Difference]: Start difference. First operand has 70 places, 57 transitions, 360 flow. Second operand 7 states and 87 transitions. [2024-06-04 17:11:42,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 492 flow [2024-06-04 17:11:42,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 463 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:11:42,803 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 356 flow [2024-06-04 17:11:42,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2024-06-04 17:11:42,805 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-04 17:11:42,805 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 356 flow [2024-06-04 17:11:42,805 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 17:11:42,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:42,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:42,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:11:42,805 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 17:11:42,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash -891961799, now seen corresponding path program 2 times [2024-06-04 17:11:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941934317] [2024-06-04 17:11:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:50,227 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 17:11:50,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:50,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941934317] [2024-06-04 17:11:50,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941934317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:50,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:50,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256412457] [2024-06-04 17:11:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:50,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:50,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:50,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:50,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:50,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:50,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 356 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 17:11:50,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:50,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:50,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:50,727 INFO L124 PetriNetUnfolderBase]: 264/480 cut-off events. [2024-06-04 17:11:50,727 INFO L125 PetriNetUnfolderBase]: For 5908/5908 co-relation queries the response was YES. [2024-06-04 17:11:50,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 480 events. 264/480 cut-off events. For 5908/5908 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1762 event pairs, 61 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2186. Up to 445 conditions per place. [2024-06-04 17:11:50,731 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 49 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-04 17:11:50,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 504 flow [2024-06-04 17:11:50,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 17:11:50,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36554621848739494 [2024-06-04 17:11:50,732 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 356 flow. Second operand 7 states and 87 transitions. [2024-06-04 17:11:50,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 504 flow [2024-06-04 17:11:50,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 468 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:11:50,736 INFO L231 Difference]: Finished difference. Result has 73 places, 59 transitions, 363 flow [2024-06-04 17:11:50,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=73, PETRI_TRANSITIONS=59} [2024-06-04 17:11:50,737 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2024-06-04 17:11:50,737 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 59 transitions, 363 flow [2024-06-04 17:11:50,738 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 17:11:50,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:50,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:50,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:11:50,738 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 17:11:50,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash -891970169, now seen corresponding path program 3 times [2024-06-04 17:11:50,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259684776] [2024-06-04 17:11:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:50,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:11:58,587 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 17:11:58,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:11:58,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259684776] [2024-06-04 17:11:58,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259684776] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:11:58,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:11:58,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:11:58,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123997747] [2024-06-04 17:11:58,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:11:58,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:11:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:11:58,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:11:58,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:11:58,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:11:58,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 59 transitions, 363 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 17:11:58,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:11:58,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:11:58,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:11:59,014 INFO L124 PetriNetUnfolderBase]: 262/477 cut-off events. [2024-06-04 17:11:59,014 INFO L125 PetriNetUnfolderBase]: For 6550/6550 co-relation queries the response was YES. [2024-06-04 17:11:59,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 477 events. 262/477 cut-off events. For 6550/6550 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1755 event pairs, 61 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 2200. Up to 436 conditions per place. [2024-06-04 17:11:59,017 INFO L140 encePairwiseOnDemand]: 26/34 looper letters, 46 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2024-06-04 17:11:59,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 497 flow [2024-06-04 17:11:59,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:11:59,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:11:59,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-04 17:11:59,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739495798319328 [2024-06-04 17:11:59,019 INFO L175 Difference]: Start difference. First operand has 73 places, 59 transitions, 363 flow. Second operand 7 states and 89 transitions. [2024-06-04 17:11:59,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 497 flow [2024-06-04 17:11:59,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 472 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:11:59,023 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 369 flow [2024-06-04 17:11:59,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-06-04 17:11:59,023 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 42 predicate places. [2024-06-04 17:11:59,023 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 369 flow [2024-06-04 17:11:59,024 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 17:11:59,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:11:59,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:11:59,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:11:59,024 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 17:11:59,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:11:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1350389632, now seen corresponding path program 1 times [2024-06-04 17:11:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:11:59,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548742609] [2024-06-04 17:11:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:11:59,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:11:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:06,682 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 17:12:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548742609] [2024-06-04 17:12:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548742609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:06,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:06,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:06,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829159498] [2024-06-04 17:12:06,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:06,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:06,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:06,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:06,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:06,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:12:06,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 369 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 17:12:06,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:06,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:12:06,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:07,171 INFO L124 PetriNetUnfolderBase]: 263/480 cut-off events. [2024-06-04 17:12:07,171 INFO L125 PetriNetUnfolderBase]: For 7521/7521 co-relation queries the response was YES. [2024-06-04 17:12:07,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2310 conditions, 480 events. 263/480 cut-off events. For 7521/7521 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1773 event pairs, 59 based on Foata normal form. 1/481 useless extension candidates. Maximal degree in co-relation 2273. Up to 389 conditions per place. [2024-06-04 17:12:07,175 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 51 selfloop transitions, 23 changer transitions 0/81 dead transitions. [2024-06-04 17:12:07,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 81 transitions, 619 flow [2024-06-04 17:12:07,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:07,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2024-06-04 17:12:07,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-06-04 17:12:07,176 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 369 flow. Second operand 8 states and 119 transitions. [2024-06-04 17:12:07,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 81 transitions, 619 flow [2024-06-04 17:12:07,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 81 transitions, 578 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:12:07,182 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 407 flow [2024-06-04 17:12:07,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-06-04 17:12:07,183 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2024-06-04 17:12:07,183 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 407 flow [2024-06-04 17:12:07,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 17:12:07,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:07,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:07,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:12:07,184 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 17:12:07,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539579, now seen corresponding path program 1 times [2024-06-04 17:12:07,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:07,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660705280] [2024-06-04 17:12:07,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:15,165 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 17:12:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660705280] [2024-06-04 17:12:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660705280] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:15,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:15,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:15,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010340712] [2024-06-04 17:12:15,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:15,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:15,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:15,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:15,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:15,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:12:15,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 407 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 17:12:15,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:15,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:12:15,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:15,660 INFO L124 PetriNetUnfolderBase]: 284/503 cut-off events. [2024-06-04 17:12:15,661 INFO L125 PetriNetUnfolderBase]: For 8311/8311 co-relation queries the response was YES. [2024-06-04 17:12:15,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 503 events. 284/503 cut-off events. For 8311/8311 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1825 event pairs, 61 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2461. Up to 431 conditions per place. [2024-06-04 17:12:15,664 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 55 selfloop transitions, 25 changer transitions 0/82 dead transitions. [2024-06-04 17:12:15,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 82 transitions, 663 flow [2024-06-04 17:12:15,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:12:15,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-04 17:12:15,665 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 407 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:12:15,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 82 transitions, 663 flow [2024-06-04 17:12:15,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 82 transitions, 626 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:15,671 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 453 flow [2024-06-04 17:12:15,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=453, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2024-06-04 17:12:15,671 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2024-06-04 17:12:15,672 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 453 flow [2024-06-04 17:12:15,672 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 17:12:15,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:15,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:15,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 17:12:15,672 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 17:12:15,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:15,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1350539362, now seen corresponding path program 2 times [2024-06-04 17:12:15,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:15,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838165712] [2024-06-04 17:12:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:23,253 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 17:12:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838165712] [2024-06-04 17:12:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838165712] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800078372] [2024-06-04 17:12:23,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:23,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:23,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:23,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 34 [2024-06-04 17:12:23,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 453 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 17:12:23,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:23,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 34 [2024-06-04 17:12:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:23,629 INFO L124 PetriNetUnfolderBase]: 271/492 cut-off events. [2024-06-04 17:12:23,630 INFO L125 PetriNetUnfolderBase]: For 9387/9387 co-relation queries the response was YES. [2024-06-04 17:12:23,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2544 conditions, 492 events. 271/492 cut-off events. For 9387/9387 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1818 event pairs, 58 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 2504. Up to 398 conditions per place. [2024-06-04 17:12:23,633 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-06-04 17:12:23,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 689 flow [2024-06-04 17:12:23,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:23,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 117 transitions. [2024-06-04 17:12:23,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43014705882352944 [2024-06-04 17:12:23,643 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 453 flow. Second operand 8 states and 117 transitions. [2024-06-04 17:12:23,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 689 flow [2024-06-04 17:12:23,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 84 transitions, 657 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:23,649 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 484 flow [2024-06-04 17:12:23,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-06-04 17:12:23,650 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 52 predicate places. [2024-06-04 17:12:23,650 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 484 flow [2024-06-04 17:12:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 17:12:23,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:23,650 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:23,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 17:12:23,650 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 17:12:23,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1033294013, now seen corresponding path program 2 times [2024-06-04 17:12:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:23,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262099373] [2024-06-04 17:12:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:23,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:31,689 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 17:12:31,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:31,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262099373] [2024-06-04 17:12:31,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262099373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:31,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:31,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392059756] [2024-06-04 17:12:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:31,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:31,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:12:31,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 484 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 17:12:31,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:31,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:12:31,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:32,201 INFO L124 PetriNetUnfolderBase]: 295/521 cut-off events. [2024-06-04 17:12:32,202 INFO L125 PetriNetUnfolderBase]: For 10423/10423 co-relation queries the response was YES. [2024-06-04 17:12:32,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 521 events. 295/521 cut-off events. For 10423/10423 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1900 event pairs, 61 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 2724. Up to 446 conditions per place. [2024-06-04 17:12:32,206 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 58 selfloop transitions, 26 changer transitions 0/86 dead transitions. [2024-06-04 17:12:32,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 86 transitions, 790 flow [2024-06-04 17:12:32,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:12:32,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-04 17:12:32,207 INFO L175 Difference]: Start difference. First operand has 85 places, 69 transitions, 484 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:12:32,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 86 transitions, 790 flow [2024-06-04 17:12:32,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 86 transitions, 753 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 17:12:32,215 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 532 flow [2024-06-04 17:12:32,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=532, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-06-04 17:12:32,216 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 55 predicate places. [2024-06-04 17:12:32,216 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 532 flow [2024-06-04 17:12:32,216 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 17:12:32,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:32,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:32,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 17:12:32,216 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 17:12:32,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1033293796, now seen corresponding path program 3 times [2024-06-04 17:12:32,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:32,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657668815] [2024-06-04 17:12:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:32,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:41,384 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 17:12:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657668815] [2024-06-04 17:12:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657668815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674717931] [2024-06-04 17:12:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:41,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:41,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:41,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:41,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:12:41,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 532 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 17:12:41,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:41,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:12:41,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:41,897 INFO L124 PetriNetUnfolderBase]: 282/510 cut-off events. [2024-06-04 17:12:41,897 INFO L125 PetriNetUnfolderBase]: For 11640/11640 co-relation queries the response was YES. [2024-06-04 17:12:41,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 510 events. 282/510 cut-off events. For 11640/11640 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1899 event pairs, 58 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 2736. Up to 410 conditions per place. [2024-06-04 17:12:41,901 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 52 selfloop transitions, 24 changer transitions 0/87 dead transitions. [2024-06-04 17:12:41,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 768 flow [2024-06-04 17:12:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-04 17:12:41,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39338235294117646 [2024-06-04 17:12:41,903 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 532 flow. Second operand 8 states and 107 transitions. [2024-06-04 17:12:41,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 768 flow [2024-06-04 17:12:41,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 730 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:12:41,911 INFO L231 Difference]: Finished difference. Result has 92 places, 75 transitions, 561 flow [2024-06-04 17:12:41,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=92, PETRI_TRANSITIONS=75} [2024-06-04 17:12:41,911 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 59 predicate places. [2024-06-04 17:12:41,911 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 75 transitions, 561 flow [2024-06-04 17:12:41,911 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 17:12:41,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:41,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:41,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 17:12:41,912 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 17:12:41,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301732, now seen corresponding path program 1 times [2024-06-04 17:12:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:41,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330807935] [2024-06-04 17:12:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:50,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 17:12:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:50,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330807935] [2024-06-04 17:12:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330807935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076312179] [2024-06-04 17:12:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:50,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:50,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:50,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:50,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:12:50,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 75 transitions, 561 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 17:12:50,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:50,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:12:50,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:50,594 INFO L124 PetriNetUnfolderBase]: 300/540 cut-off events. [2024-06-04 17:12:50,594 INFO L125 PetriNetUnfolderBase]: For 13637/13637 co-relation queries the response was YES. [2024-06-04 17:12:50,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 540 events. 300/540 cut-off events. For 13637/13637 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2049 event pairs, 64 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 2918. Up to 445 conditions per place. [2024-06-04 17:12:50,598 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 66 selfloop transitions, 20 changer transitions 0/97 dead transitions. [2024-06-04 17:12:50,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 97 transitions, 843 flow [2024-06-04 17:12:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:50,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-04 17:12:50,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40808823529411764 [2024-06-04 17:12:50,600 INFO L175 Difference]: Start difference. First operand has 92 places, 75 transitions, 561 flow. Second operand 8 states and 111 transitions. [2024-06-04 17:12:50,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 97 transitions, 843 flow [2024-06-04 17:12:50,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 97 transitions, 804 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 17:12:50,610 INFO L231 Difference]: Finished difference. Result has 96 places, 81 transitions, 611 flow [2024-06-04 17:12:50,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=611, PETRI_PLACES=96, PETRI_TRANSITIONS=81} [2024-06-04 17:12:50,611 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2024-06-04 17:12:50,611 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 81 transitions, 611 flow [2024-06-04 17:12:50,611 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 17:12:50,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:50,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:50,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 17:12:50,612 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 17:12:50,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1033301453, now seen corresponding path program 3 times [2024-06-04 17:12:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582999281] [2024-06-04 17:12:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:12:58,724 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 17:12:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:12:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582999281] [2024-06-04 17:12:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582999281] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:12:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:12:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:12:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18465591] [2024-06-04 17:12:58,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:12:58,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:12:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:12:58,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:12:58,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:12:58,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:12:58,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 81 transitions, 611 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 17:12:58,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:12:58,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:12:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:12:59,172 INFO L124 PetriNetUnfolderBase]: 315/554 cut-off events. [2024-06-04 17:12:59,173 INFO L125 PetriNetUnfolderBase]: For 14079/14079 co-relation queries the response was YES. [2024-06-04 17:12:59,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3161 conditions, 554 events. 315/554 cut-off events. For 14079/14079 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2052 event pairs, 63 based on Foata normal form. 1/555 useless extension candidates. Maximal degree in co-relation 3115. Up to 480 conditions per place. [2024-06-04 17:12:59,183 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 64 selfloop transitions, 27 changer transitions 0/93 dead transitions. [2024-06-04 17:12:59,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 93 transitions, 867 flow [2024-06-04 17:12:59,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:12:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:12:59,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2024-06-04 17:12:59,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3713235294117647 [2024-06-04 17:12:59,191 INFO L175 Difference]: Start difference. First operand has 96 places, 81 transitions, 611 flow. Second operand 8 states and 101 transitions. [2024-06-04 17:12:59,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 93 transitions, 867 flow [2024-06-04 17:12:59,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 93 transitions, 847 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-04 17:12:59,207 INFO L231 Difference]: Finished difference. Result has 101 places, 81 transitions, 650 flow [2024-06-04 17:12:59,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=650, PETRI_PLACES=101, PETRI_TRANSITIONS=81} [2024-06-04 17:12:59,208 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 68 predicate places. [2024-06-04 17:12:59,208 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 81 transitions, 650 flow [2024-06-04 17:12:59,209 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 17:12:59,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:12:59,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:12:59,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 17:12:59,210 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 17:12:59,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:12:59,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2023699770, now seen corresponding path program 2 times [2024-06-04 17:12:59,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:12:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981685663] [2024-06-04 17:12:59,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:12:59,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:12:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:07,514 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 17:13:07,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:07,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981685663] [2024-06-04 17:13:07,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981685663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:07,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:07,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379758214] [2024-06-04 17:13:07,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:07,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:07,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:07,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:07,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:07,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:13:07,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 81 transitions, 650 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 17:13:07,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:07,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:13:07,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:08,128 INFO L124 PetriNetUnfolderBase]: 307/552 cut-off events. [2024-06-04 17:13:08,129 INFO L125 PetriNetUnfolderBase]: For 15996/15996 co-relation queries the response was YES. [2024-06-04 17:13:08,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3217 conditions, 552 events. 307/552 cut-off events. For 15996/15996 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2082 event pairs, 61 based on Foata normal form. 3/555 useless extension candidates. Maximal degree in co-relation 3168. Up to 500 conditions per place. [2024-06-04 17:13:08,133 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 70 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-06-04 17:13:08,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 93 transitions, 854 flow [2024-06-04 17:13:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-04 17:13:08,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3639705882352941 [2024-06-04 17:13:08,134 INFO L175 Difference]: Start difference. First operand has 101 places, 81 transitions, 650 flow. Second operand 8 states and 99 transitions. [2024-06-04 17:13:08,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 93 transitions, 854 flow [2024-06-04 17:13:08,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 93 transitions, 795 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 17:13:08,146 INFO L231 Difference]: Finished difference. Result has 102 places, 83 transitions, 640 flow [2024-06-04 17:13:08,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=640, PETRI_PLACES=102, PETRI_TRANSITIONS=83} [2024-06-04 17:13:08,146 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-04 17:13:08,146 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 83 transitions, 640 flow [2024-06-04 17:13:08,147 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 17:13:08,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:08,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:08,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 17:13:08,147 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 17:13:08,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 546365914, now seen corresponding path program 4 times [2024-06-04 17:13:08,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:08,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668512794] [2024-06-04 17:13:08,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:16,685 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 17:13:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668512794] [2024-06-04 17:13:16,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668512794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:16,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:16,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318439605] [2024-06-04 17:13:16,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:16,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:16,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:16,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:13:16,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 83 transitions, 640 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 17:13:16,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:16,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:13:16,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:17,228 INFO L124 PetriNetUnfolderBase]: 305/549 cut-off events. [2024-06-04 17:13:17,228 INFO L125 PetriNetUnfolderBase]: For 16531/16531 co-relation queries the response was YES. [2024-06-04 17:13:17,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 549 events. 305/549 cut-off events. For 16531/16531 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2072 event pairs, 59 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 3187. Up to 496 conditions per place. [2024-06-04 17:13:17,231 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 68 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2024-06-04 17:13:17,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 91 transitions, 818 flow [2024-06-04 17:13:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-04 17:13:17,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35661764705882354 [2024-06-04 17:13:17,233 INFO L175 Difference]: Start difference. First operand has 102 places, 83 transitions, 640 flow. Second operand 8 states and 97 transitions. [2024-06-04 17:13:17,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 91 transitions, 818 flow [2024-06-04 17:13:17,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 91 transitions, 784 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:17,244 INFO L231 Difference]: Finished difference. Result has 104 places, 83 transitions, 635 flow [2024-06-04 17:13:17,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2024-06-04 17:13:17,244 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2024-06-04 17:13:17,244 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 635 flow [2024-06-04 17:13:17,245 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 17:13:17,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:17,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:17,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 17:13:17,245 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 17:13:17,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:17,246 INFO L85 PathProgramCache]: Analyzing trace with hash 546366131, now seen corresponding path program 4 times [2024-06-04 17:13:17,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:17,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564383371] [2024-06-04 17:13:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:17,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:25,202 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 17:13:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564383371] [2024-06-04 17:13:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564383371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:25,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:25,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:25,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072782589] [2024-06-04 17:13:25,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:25,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:25,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:13:25,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 635 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 17:13:25,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:25,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:13:25,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:25,738 INFO L124 PetriNetUnfolderBase]: 325/571 cut-off events. [2024-06-04 17:13:25,739 INFO L125 PetriNetUnfolderBase]: For 17510/17510 co-relation queries the response was YES. [2024-06-04 17:13:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 571 events. 325/571 cut-off events. For 17510/17510 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2109 event pairs, 61 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 3310. Up to 535 conditions per place. [2024-06-04 17:13:25,742 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 74 selfloop transitions, 18 changer transitions 0/94 dead transitions. [2024-06-04 17:13:25,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 94 transitions, 907 flow [2024-06-04 17:13:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-04 17:13:25,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-04 17:13:25,743 INFO L175 Difference]: Start difference. First operand has 104 places, 83 transitions, 635 flow. Second operand 8 states and 94 transitions. [2024-06-04 17:13:25,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 94 transitions, 907 flow [2024-06-04 17:13:25,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 94 transitions, 847 flow, removed 1 selfloop flow, removed 10 redundant places. [2024-06-04 17:13:25,755 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 632 flow [2024-06-04 17:13:25,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=632, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-06-04 17:13:25,755 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 69 predicate places. [2024-06-04 17:13:25,755 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 632 flow [2024-06-04 17:13:25,756 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 17:13:25,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:25,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:25,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 17:13:25,756 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 17:13:25,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:25,756 INFO L85 PathProgramCache]: Analyzing trace with hash -235196979, now seen corresponding path program 5 times [2024-06-04 17:13:25,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:25,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459573452] [2024-06-04 17:13:25,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:25,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:33,614 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 17:13:33,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:33,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459573452] [2024-06-04 17:13:33,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459573452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:33,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:33,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:33,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816231811] [2024-06-04 17:13:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:33,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:33,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:33,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:13:33,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 632 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 17:13:33,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:33,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:13:33,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:34,176 INFO L124 PetriNetUnfolderBase]: 328/576 cut-off events. [2024-06-04 17:13:34,176 INFO L125 PetriNetUnfolderBase]: For 18818/18818 co-relation queries the response was YES. [2024-06-04 17:13:34,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3417 conditions, 576 events. 328/576 cut-off events. For 18818/18818 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2152 event pairs, 61 based on Foata normal form. 1/577 useless extension candidates. Maximal degree in co-relation 3367. Up to 539 conditions per place. [2024-06-04 17:13:34,180 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 75 selfloop transitions, 19 changer transitions 0/96 dead transitions. [2024-06-04 17:13:34,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 96 transitions, 914 flow [2024-06-04 17:13:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:34,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2024-06-04 17:13:34,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3492647058823529 [2024-06-04 17:13:34,181 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 632 flow. Second operand 8 states and 95 transitions. [2024-06-04 17:13:34,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 96 transitions, 914 flow [2024-06-04 17:13:34,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 96 transitions, 845 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 17:13:34,195 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 626 flow [2024-06-04 17:13:34,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=626, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2024-06-04 17:13:34,209 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 70 predicate places. [2024-06-04 17:13:34,209 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 626 flow [2024-06-04 17:13:34,209 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 17:13:34,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:34,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:34,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 17:13:34,210 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 17:13:34,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 555570620, now seen corresponding path program 3 times [2024-06-04 17:13:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:34,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004164436] [2024-06-04 17:13:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:34,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:42,363 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 17:13:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004164436] [2024-06-04 17:13:42,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004164436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:42,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:42,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:42,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065297205] [2024-06-04 17:13:42,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:42,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:42,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:42,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:42,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:42,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:13:42,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 626 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 17:13:42,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:42,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:13:42,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:42,934 INFO L124 PetriNetUnfolderBase]: 320/574 cut-off events. [2024-06-04 17:13:42,935 INFO L125 PetriNetUnfolderBase]: For 20996/20996 co-relation queries the response was YES. [2024-06-04 17:13:42,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 574 events. 320/574 cut-off events. For 20996/20996 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2196 event pairs, 61 based on Foata normal form. 3/577 useless extension candidates. Maximal degree in co-relation 3369. Up to 506 conditions per place. [2024-06-04 17:13:42,938 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 73 selfloop transitions, 15 changer transitions 0/101 dead transitions. [2024-06-04 17:13:42,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 101 transitions, 852 flow [2024-06-04 17:13:42,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-04 17:13:42,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2024-06-04 17:13:42,939 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 626 flow. Second operand 8 states and 103 transitions. [2024-06-04 17:13:42,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 101 transitions, 852 flow [2024-06-04 17:13:42,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 101 transitions, 819 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:13:42,959 INFO L231 Difference]: Finished difference. Result has 106 places, 89 transitions, 652 flow [2024-06-04 17:13:42,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=652, PETRI_PLACES=106, PETRI_TRANSITIONS=89} [2024-06-04 17:13:42,961 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 73 predicate places. [2024-06-04 17:13:42,962 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 89 transitions, 652 flow [2024-06-04 17:13:42,962 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 17:13:42,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:42,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:42,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 17:13:42,962 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 17:13:42,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 546373850, now seen corresponding path program 4 times [2024-06-04 17:13:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228810340] [2024-06-04 17:13:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:51,433 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 17:13:51,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:51,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228810340] [2024-06-04 17:13:51,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228810340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29959955] [2024-06-04 17:13:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:51,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:51,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:13:51,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 89 transitions, 652 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 17:13:51,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:51,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:13:51,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:51,926 INFO L124 PetriNetUnfolderBase]: 314/565 cut-off events. [2024-06-04 17:13:51,926 INFO L125 PetriNetUnfolderBase]: For 21262/21262 co-relation queries the response was YES. [2024-06-04 17:13:51,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3360 conditions, 565 events. 314/565 cut-off events. For 21262/21262 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2155 event pairs, 59 based on Foata normal form. 3/568 useless extension candidates. Maximal degree in co-relation 3308. Up to 482 conditions per place. [2024-06-04 17:13:51,930 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 69 selfloop transitions, 19 changer transitions 0/101 dead transitions. [2024-06-04 17:13:51,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 101 transitions, 858 flow [2024-06-04 17:13:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:13:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:13:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-04 17:13:51,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3860294117647059 [2024-06-04 17:13:51,932 INFO L175 Difference]: Start difference. First operand has 106 places, 89 transitions, 652 flow. Second operand 8 states and 105 transitions. [2024-06-04 17:13:51,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 101 transitions, 858 flow [2024-06-04 17:13:51,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 101 transitions, 817 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 17:13:51,955 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 654 flow [2024-06-04 17:13:51,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=654, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2024-06-04 17:13:51,956 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2024-06-04 17:13:51,956 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 654 flow [2024-06-04 17:13:51,957 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 17:13:51,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:51,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:51,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 17:13:51,957 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 17:13:51,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:51,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1881011421, now seen corresponding path program 6 times [2024-06-04 17:13:51,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:51,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549453655] [2024-06-04 17:13:51,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:51,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:13:59,289 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 17:13:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:13:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549453655] [2024-06-04 17:13:59,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549453655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:13:59,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:13:59,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:13:59,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643074596] [2024-06-04 17:13:59,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:13:59,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:13:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:13:59,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:13:59,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:13:59,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:13:59,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 654 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 17:13:59,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:13:59,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:13:59,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:13:59,847 INFO L124 PetriNetUnfolderBase]: 329/582 cut-off events. [2024-06-04 17:13:59,847 INFO L125 PetriNetUnfolderBase]: For 21382/21382 co-relation queries the response was YES. [2024-06-04 17:13:59,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3456 conditions, 582 events. 329/582 cut-off events. For 21382/21382 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2198 event pairs, 131 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 3403. Up to 558 conditions per place. [2024-06-04 17:13:59,850 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 82 selfloop transitions, 14 changer transitions 0/98 dead transitions. [2024-06-04 17:13:59,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 98 transitions, 874 flow [2024-06-04 17:13:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:13:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:13:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 17:13:59,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31699346405228757 [2024-06-04 17:13:59,851 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 654 flow. Second operand 9 states and 97 transitions. [2024-06-04 17:13:59,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 98 transitions, 874 flow [2024-06-04 17:13:59,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 98 transitions, 803 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-04 17:13:59,867 INFO L231 Difference]: Finished difference. Result has 111 places, 91 transitions, 633 flow [2024-06-04 17:13:59,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=633, PETRI_PLACES=111, PETRI_TRANSITIONS=91} [2024-06-04 17:13:59,867 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 78 predicate places. [2024-06-04 17:13:59,867 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 91 transitions, 633 flow [2024-06-04 17:13:59,868 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 17:13:59,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:13:59,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:13:59,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 17:13:59,868 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 17:13:59,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:13:59,868 INFO L85 PathProgramCache]: Analyzing trace with hash 476405116, now seen corresponding path program 1 times [2024-06-04 17:13:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:13:59,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867007095] [2024-06-04 17:13:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:13:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:13:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:10,995 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 17:14:10,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:10,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867007095] [2024-06-04 17:14:10,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867007095] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:10,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:10,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:14:10,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583745852] [2024-06-04 17:14:10,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:10,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:14:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:10,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:14:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:14:11,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:14:11,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 91 transitions, 633 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 17:14:11,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:11,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:14:11,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:11,647 INFO L124 PetriNetUnfolderBase]: 337/610 cut-off events. [2024-06-04 17:14:11,647 INFO L125 PetriNetUnfolderBase]: For 22774/22776 co-relation queries the response was YES. [2024-06-04 17:14:11,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 610 events. 337/610 cut-off events. For 22774/22776 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2434 event pairs, 57 based on Foata normal form. 3/613 useless extension candidates. Maximal degree in co-relation 3484. Up to 501 conditions per place. [2024-06-04 17:14:11,651 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 84 selfloop transitions, 24 changer transitions 0/121 dead transitions. [2024-06-04 17:14:11,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 975 flow [2024-06-04 17:14:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:11,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-04 17:14:11,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-04 17:14:11,652 INFO L175 Difference]: Start difference. First operand has 111 places, 91 transitions, 633 flow. Second operand 9 states and 121 transitions. [2024-06-04 17:14:11,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 975 flow [2024-06-04 17:14:11,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 121 transitions, 933 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:14:11,666 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 745 flow [2024-06-04 17:14:11,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=745, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2024-06-04 17:14:11,667 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 81 predicate places. [2024-06-04 17:14:11,667 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 745 flow [2024-06-04 17:14:11,667 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 17:14:11,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:11,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:11,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 17:14:11,668 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 17:14:11,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash 176463930, now seen corresponding path program 2 times [2024-06-04 17:14:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:11,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626026635] [2024-06-04 17:14:11,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:22,860 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 17:14:22,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:22,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626026635] [2024-06-04 17:14:22,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626026635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:22,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:22,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:14:22,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593756621] [2024-06-04 17:14:22,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:22,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:14:22,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:22,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:14:22,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:14:23,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:14:23,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 745 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 17:14:23,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:23,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:14:23,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:23,562 INFO L124 PetriNetUnfolderBase]: 356/645 cut-off events. [2024-06-04 17:14:23,562 INFO L125 PetriNetUnfolderBase]: For 24318/24318 co-relation queries the response was YES. [2024-06-04 17:14:23,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 645 events. 356/645 cut-off events. For 24318/24318 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2616 event pairs, 109 based on Foata normal form. 1/646 useless extension candidates. Maximal degree in co-relation 3798. Up to 566 conditions per place. [2024-06-04 17:14:23,567 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 99 selfloop transitions, 18 changer transitions 0/130 dead transitions. [2024-06-04 17:14:23,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 130 transitions, 1114 flow [2024-06-04 17:14:23,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:14:23,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:14:23,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:14:23,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-04 17:14:23,567 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 745 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:14:23,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 130 transitions, 1114 flow [2024-06-04 17:14:23,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 130 transitions, 1071 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:23,590 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 868 flow [2024-06-04 17:14:23,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=868, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2024-06-04 17:14:23,591 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 91 predicate places. [2024-06-04 17:14:23,591 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 868 flow [2024-06-04 17:14:23,591 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 17:14:23,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:23,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 17:14:23,591 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 17:14:23,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:23,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1778204934, now seen corresponding path program 3 times [2024-06-04 17:14:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992002650] [2024-06-04 17:14:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:33,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 17:14:33,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:33,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992002650] [2024-06-04 17:14:33,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992002650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:33,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:33,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:14:33,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949715039] [2024-06-04 17:14:33,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:33,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:14:33,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:33,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:14:33,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:14:34,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:14:34,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 868 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 17:14:34,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:34,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:14:34,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:34,503 INFO L124 PetriNetUnfolderBase]: 364/655 cut-off events. [2024-06-04 17:14:34,503 INFO L125 PetriNetUnfolderBase]: For 27887/27889 co-relation queries the response was YES. [2024-06-04 17:14:34,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4087 conditions, 655 events. 364/655 cut-off events. For 27887/27889 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2716 event pairs, 90 based on Foata normal form. 1/654 useless extension candidates. Maximal degree in co-relation 4024. Up to 531 conditions per place. [2024-06-04 17:14:34,509 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 91 selfloop transitions, 32 changer transitions 0/136 dead transitions. [2024-06-04 17:14:34,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 1203 flow [2024-06-04 17:14:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:14:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:14:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:14:34,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-04 17:14:34,512 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 868 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:14:34,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 1203 flow [2024-06-04 17:14:34,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 1161 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-04 17:14:34,546 INFO L231 Difference]: Finished difference. Result has 130 places, 120 transitions, 963 flow [2024-06-04 17:14:34,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=130, PETRI_TRANSITIONS=120} [2024-06-04 17:14:34,547 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 97 predicate places. [2024-06-04 17:14:34,547 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 120 transitions, 963 flow [2024-06-04 17:14:34,547 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 17:14:34,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:34,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:34,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 17:14:34,548 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 17:14:34,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:34,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1298493426, now seen corresponding path program 4 times [2024-06-04 17:14:34,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:34,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300575993] [2024-06-04 17:14:34,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:34,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:44,640 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 17:14:44,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:44,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300575993] [2024-06-04 17:14:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300575993] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:44,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:14:44,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916787600] [2024-06-04 17:14:44,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:44,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:14:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:44,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:14:44,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:14:44,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:14:44,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 120 transitions, 963 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 17:14:44,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:44,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:14:44,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:45,203 INFO L124 PetriNetUnfolderBase]: 373/673 cut-off events. [2024-06-04 17:14:45,203 INFO L125 PetriNetUnfolderBase]: For 28556/28557 co-relation queries the response was YES. [2024-06-04 17:14:45,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4304 conditions, 673 events. 373/673 cut-off events. For 28556/28557 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2827 event pairs, 93 based on Foata normal form. 1/673 useless extension candidates. Maximal degree in co-relation 4239. Up to 521 conditions per place. [2024-06-04 17:14:45,209 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 90 selfloop transitions, 44 changer transitions 0/147 dead transitions. [2024-06-04 17:14:45,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 1370 flow [2024-06-04 17:14:45,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:14:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:14:45,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-04 17:14:45,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:14:45,210 INFO L175 Difference]: Start difference. First operand has 130 places, 120 transitions, 963 flow. Second operand 12 states and 152 transitions. [2024-06-04 17:14:45,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 1370 flow [2024-06-04 17:14:45,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 147 transitions, 1290 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:45,244 INFO L231 Difference]: Finished difference. Result has 140 places, 128 transitions, 1104 flow [2024-06-04 17:14:45,244 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1104, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2024-06-04 17:14:45,245 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 107 predicate places. [2024-06-04 17:14:45,245 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 1104 flow [2024-06-04 17:14:45,245 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 17:14:45,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:45,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:45,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 17:14:45,246 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 17:14:45,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:45,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1358895648, now seen corresponding path program 1 times [2024-06-04 17:14:45,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:45,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691440048] [2024-06-04 17:14:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:14:54,839 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 17:14:54,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:14:54,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691440048] [2024-06-04 17:14:54,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691440048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:14:54,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:14:54,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:14:54,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489016749] [2024-06-04 17:14:54,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:14:54,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:14:54,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:14:54,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:14:54,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:14:54,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:14:54,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 1104 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 17:14:54,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:14:54,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:14:54,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:14:55,510 INFO L124 PetriNetUnfolderBase]: 393/695 cut-off events. [2024-06-04 17:14:55,511 INFO L125 PetriNetUnfolderBase]: For 29077/29077 co-relation queries the response was YES. [2024-06-04 17:14:55,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4507 conditions, 695 events. 393/695 cut-off events. For 29077/29077 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2845 event pairs, 97 based on Foata normal form. 1/696 useless extension candidates. Maximal degree in co-relation 4438. Up to 531 conditions per place. [2024-06-04 17:14:55,515 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 96 selfloop transitions, 51 changer transitions 0/149 dead transitions. [2024-06-04 17:14:55,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 149 transitions, 1536 flow [2024-06-04 17:14:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:14:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:14:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:14:55,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:14:55,516 INFO L175 Difference]: Start difference. First operand has 140 places, 128 transitions, 1104 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:14:55,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 149 transitions, 1536 flow [2024-06-04 17:14:55,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 149 transitions, 1452 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 17:14:55,550 INFO L231 Difference]: Finished difference. Result has 145 places, 132 transitions, 1155 flow [2024-06-04 17:14:55,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1155, PETRI_PLACES=145, PETRI_TRANSITIONS=132} [2024-06-04 17:14:55,551 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2024-06-04 17:14:55,551 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 132 transitions, 1155 flow [2024-06-04 17:14:55,551 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 17:14:55,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:14:55,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:14:55,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 17:14:55,552 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 17:14:55,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:14:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 875132374, now seen corresponding path program 2 times [2024-06-04 17:14:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:14:55,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129599790] [2024-06-04 17:14:55,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:14:55,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:14:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:06,534 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 17:15:06,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129599790] [2024-06-04 17:15:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129599790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:06,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:06,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477152814] [2024-06-04 17:15:06,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:06,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:06,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:06,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:06,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:06,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:15:06,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 132 transitions, 1155 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 17:15:06,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:06,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:15:06,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:07,288 INFO L124 PetriNetUnfolderBase]: 410/723 cut-off events. [2024-06-04 17:15:07,289 INFO L125 PetriNetUnfolderBase]: For 31421/31421 co-relation queries the response was YES. [2024-06-04 17:15:07,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 723 events. 410/723 cut-off events. For 31421/31421 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3006 event pairs, 99 based on Foata normal form. 1/724 useless extension candidates. Maximal degree in co-relation 4693. Up to 545 conditions per place. [2024-06-04 17:15:07,294 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 50 changer transitions 0/160 dead transitions. [2024-06-04 17:15:07,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 160 transitions, 1752 flow [2024-06-04 17:15:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:15:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:15:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-04 17:15:07,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:15:07,318 INFO L175 Difference]: Start difference. First operand has 145 places, 132 transitions, 1155 flow. Second operand 10 states and 130 transitions. [2024-06-04 17:15:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 160 transitions, 1752 flow [2024-06-04 17:15:07,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 160 transitions, 1676 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:07,362 INFO L231 Difference]: Finished difference. Result has 150 places, 141 transitions, 1276 flow [2024-06-04 17:15:07,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1090, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1276, PETRI_PLACES=150, PETRI_TRANSITIONS=141} [2024-06-04 17:15:07,362 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 117 predicate places. [2024-06-04 17:15:07,363 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 141 transitions, 1276 flow [2024-06-04 17:15:07,363 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 17:15:07,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:07,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:07,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 17:15:07,363 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 17:15:07,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash 875132188, now seen corresponding path program 5 times [2024-06-04 17:15:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:07,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997993881] [2024-06-04 17:15:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:17,967 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 17:15:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997993881] [2024-06-04 17:15:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997993881] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310092043] [2024-06-04 17:15:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:17,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:17,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:18,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:15:18,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 141 transitions, 1276 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 17:15:18,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:18,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:15:18,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:18,729 INFO L124 PetriNetUnfolderBase]: 402/720 cut-off events. [2024-06-04 17:15:18,729 INFO L125 PetriNetUnfolderBase]: For 34201/34201 co-relation queries the response was YES. [2024-06-04 17:15:18,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4934 conditions, 720 events. 402/720 cut-off events. For 34201/34201 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3050 event pairs, 89 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 4861. Up to 539 conditions per place. [2024-06-04 17:15:18,735 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 98 selfloop transitions, 52 changer transitions 0/168 dead transitions. [2024-06-04 17:15:18,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 1781 flow [2024-06-04 17:15:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:15:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:15:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 167 transitions. [2024-06-04 17:15:18,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3778280542986425 [2024-06-04 17:15:18,737 INFO L175 Difference]: Start difference. First operand has 150 places, 141 transitions, 1276 flow. Second operand 13 states and 167 transitions. [2024-06-04 17:15:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 1781 flow [2024-06-04 17:15:18,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 168 transitions, 1722 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:15:18,790 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 1405 flow [2024-06-04 17:15:18,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1405, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-06-04 17:15:18,791 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 126 predicate places. [2024-06-04 17:15:18,791 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 1405 flow [2024-06-04 17:15:18,791 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 17:15:18,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:18,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:18,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 17:15:18,792 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 17:15:18,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:18,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1481260804, now seen corresponding path program 3 times [2024-06-04 17:15:18,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:18,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634820449] [2024-06-04 17:15:18,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:18,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:29,824 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 17:15:29,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634820449] [2024-06-04 17:15:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634820449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580369410] [2024-06-04 17:15:29,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:29,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:29,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:29,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:29,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:29,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:15:29,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 1405 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 17:15:29,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:29,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:15:29,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:30,585 INFO L124 PetriNetUnfolderBase]: 421/742 cut-off events. [2024-06-04 17:15:30,585 INFO L125 PetriNetUnfolderBase]: For 36063/36063 co-relation queries the response was YES. [2024-06-04 17:15:30,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5154 conditions, 742 events. 421/742 cut-off events. For 36063/36063 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3104 event pairs, 97 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 5080. Up to 562 conditions per place. [2024-06-04 17:15:30,590 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 108 selfloop transitions, 55 changer transitions 0/165 dead transitions. [2024-06-04 17:15:30,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 1937 flow [2024-06-04 17:15:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:15:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:15:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:15:30,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:15:30,592 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 1405 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:15:30,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 1937 flow [2024-06-04 17:15:30,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 165 transitions, 1867 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 17:15:30,639 INFO L231 Difference]: Finished difference. Result has 163 places, 149 transitions, 1464 flow [2024-06-04 17:15:30,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1464, PETRI_PLACES=163, PETRI_TRANSITIONS=149} [2024-06-04 17:15:30,640 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 130 predicate places. [2024-06-04 17:15:30,640 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 149 transitions, 1464 flow [2024-06-04 17:15:30,640 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 17:15:30,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:30,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:30,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 17:15:30,641 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 17:15:30,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:30,641 INFO L85 PathProgramCache]: Analyzing trace with hash 879780762, now seen corresponding path program 1 times [2024-06-04 17:15:30,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:30,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138493199] [2024-06-04 17:15:30,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:41,377 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 17:15:41,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:41,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138493199] [2024-06-04 17:15:41,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138493199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:41,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:41,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:41,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154142638] [2024-06-04 17:15:41,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:41,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:41,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:41,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:41,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:41,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:15:41,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 149 transitions, 1464 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 17:15:41,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:15:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:42,132 INFO L124 PetriNetUnfolderBase]: 430/757 cut-off events. [2024-06-04 17:15:42,132 INFO L125 PetriNetUnfolderBase]: For 39664/39664 co-relation queries the response was YES. [2024-06-04 17:15:42,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5321 conditions, 757 events. 430/757 cut-off events. For 39664/39664 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3186 event pairs, 106 based on Foata normal form. 3/760 useless extension candidates. Maximal degree in co-relation 5245. Up to 610 conditions per place. [2024-06-04 17:15:42,138 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 131 selfloop transitions, 42 changer transitions 0/175 dead transitions. [2024-06-04 17:15:42,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 1982 flow [2024-06-04 17:15:42,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:15:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:15:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:15:42,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:15:42,139 INFO L175 Difference]: Start difference. First operand has 163 places, 149 transitions, 1464 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:15:42,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 1982 flow [2024-06-04 17:15:42,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 175 transitions, 1898 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:15:42,186 INFO L231 Difference]: Finished difference. Result has 170 places, 158 transitions, 1577 flow [2024-06-04 17:15:42,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1577, PETRI_PLACES=170, PETRI_TRANSITIONS=158} [2024-06-04 17:15:42,186 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 137 predicate places. [2024-06-04 17:15:42,186 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 158 transitions, 1577 flow [2024-06-04 17:15:42,187 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 17:15:42,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:42,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:42,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 17:15:42,187 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 17:15:42,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:42,187 INFO L85 PathProgramCache]: Analyzing trace with hash 879773818, now seen corresponding path program 6 times [2024-06-04 17:15:42,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:42,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376782349] [2024-06-04 17:15:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:42,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:15:52,703 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 17:15:52,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:15:52,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376782349] [2024-06-04 17:15:52,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376782349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:15:52,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:15:52,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:15:52,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371252486] [2024-06-04 17:15:52,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:15:52,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:15:52,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:15:52,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:15:52,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:15:52,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:15:52,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 158 transitions, 1577 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 17:15:52,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:15:52,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:15:52,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:15:53,479 INFO L124 PetriNetUnfolderBase]: 411/737 cut-off events. [2024-06-04 17:15:53,479 INFO L125 PetriNetUnfolderBase]: For 39514/39514 co-relation queries the response was YES. [2024-06-04 17:15:53,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 737 events. 411/737 cut-off events. For 39514/39514 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3151 event pairs, 88 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 5291. Up to 554 conditions per place. [2024-06-04 17:15:53,484 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 102 selfloop transitions, 54 changer transitions 0/175 dead transitions. [2024-06-04 17:15:53,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 175 transitions, 1933 flow [2024-06-04 17:15:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:15:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:15:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 151 transitions. [2024-06-04 17:15:53,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3700980392156863 [2024-06-04 17:15:53,486 INFO L175 Difference]: Start difference. First operand has 170 places, 158 transitions, 1577 flow. Second operand 12 states and 151 transitions. [2024-06-04 17:15:53,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 175 transitions, 1933 flow [2024-06-04 17:15:53,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 175 transitions, 1822 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-04 17:15:53,542 INFO L231 Difference]: Finished difference. Result has 174 places, 158 transitions, 1579 flow [2024-06-04 17:15:53,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1579, PETRI_PLACES=174, PETRI_TRANSITIONS=158} [2024-06-04 17:15:53,542 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 141 predicate places. [2024-06-04 17:15:53,542 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 158 transitions, 1579 flow [2024-06-04 17:15:53,543 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 17:15:53,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:15:53,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:15:53,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 17:15:53,543 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 17:15:53,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:15:53,544 INFO L85 PathProgramCache]: Analyzing trace with hash -757798452, now seen corresponding path program 4 times [2024-06-04 17:15:53,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:15:53,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154563530] [2024-06-04 17:15:53,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:15:53,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:15:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:04,138 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 17:16:04,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:04,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154563530] [2024-06-04 17:16:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154563530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:04,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268436590] [2024-06-04 17:16:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:04,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:16:04,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 158 transitions, 1579 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 17:16:04,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:04,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:16:04,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:04,902 INFO L124 PetriNetUnfolderBase]: 426/751 cut-off events. [2024-06-04 17:16:04,902 INFO L125 PetriNetUnfolderBase]: For 40089/40089 co-relation queries the response was YES. [2024-06-04 17:16:04,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5450 conditions, 751 events. 426/751 cut-off events. For 40089/40089 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3138 event pairs, 96 based on Foata normal form. 1/752 useless extension candidates. Maximal degree in co-relation 5372. Up to 572 conditions per place. [2024-06-04 17:16:04,907 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 118 selfloop transitions, 53 changer transitions 0/173 dead transitions. [2024-06-04 17:16:04,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 173 transitions, 2041 flow [2024-06-04 17:16:04,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:04,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-04 17:16:04,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3735294117647059 [2024-06-04 17:16:04,909 INFO L175 Difference]: Start difference. First operand has 174 places, 158 transitions, 1579 flow. Second operand 10 states and 127 transitions. [2024-06-04 17:16:04,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 173 transitions, 2041 flow [2024-06-04 17:16:04,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 173 transitions, 1931 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:16:04,981 INFO L231 Difference]: Finished difference. Result has 175 places, 158 transitions, 1580 flow [2024-06-04 17:16:04,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1469, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1580, PETRI_PLACES=175, PETRI_TRANSITIONS=158} [2024-06-04 17:16:04,982 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 142 predicate places. [2024-06-04 17:16:04,983 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 158 transitions, 1580 flow [2024-06-04 17:16:04,983 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 17:16:04,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:04,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:04,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 17:16:04,983 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 17:16:04,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:04,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988370, now seen corresponding path program 5 times [2024-06-04 17:16:04,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:04,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396550081] [2024-06-04 17:16:04,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:04,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:16,453 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 17:16:16,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:16,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396550081] [2024-06-04 17:16:16,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396550081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:16,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:16,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:16,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204811280] [2024-06-04 17:16:16,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:16,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:16,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:16,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:16,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:16,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:16:16,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 158 transitions, 1580 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 17:16:16,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:16,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:16:16,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:17,035 INFO L124 PetriNetUnfolderBase]: 464/814 cut-off events. [2024-06-04 17:16:17,035 INFO L125 PetriNetUnfolderBase]: For 43216/43216 co-relation queries the response was YES. [2024-06-04 17:16:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5922 conditions, 814 events. 464/814 cut-off events. For 43216/43216 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3499 event pairs, 124 based on Foata normal form. 1/815 useless extension candidates. Maximal degree in co-relation 5843. Up to 711 conditions per place. [2024-06-04 17:16:17,042 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 40 changer transitions 0/197 dead transitions. [2024-06-04 17:16:17,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 197 transitions, 2354 flow [2024-06-04 17:16:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-04 17:16:17,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36764705882352944 [2024-06-04 17:16:17,044 INFO L175 Difference]: Start difference. First operand has 175 places, 158 transitions, 1580 flow. Second operand 10 states and 125 transitions. [2024-06-04 17:16:17,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 197 transitions, 2354 flow [2024-06-04 17:16:17,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 197 transitions, 2203 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-04 17:16:17,114 INFO L231 Difference]: Finished difference. Result has 178 places, 177 transitions, 1781 flow [2024-06-04 17:16:17,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1781, PETRI_PLACES=178, PETRI_TRANSITIONS=177} [2024-06-04 17:16:17,115 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 145 predicate places. [2024-06-04 17:16:17,115 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 177 transitions, 1781 flow [2024-06-04 17:16:17,115 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 17:16:17,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:17,115 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:17,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 17:16:17,115 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 17:16:17,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1460988556, now seen corresponding path program 7 times [2024-06-04 17:16:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:17,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586453044] [2024-06-04 17:16:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:28,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 17:16:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586453044] [2024-06-04 17:16:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586453044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:28,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591091200] [2024-06-04 17:16:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:28,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:28,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:28,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:28,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:28,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:16:28,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 177 transitions, 1781 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 17:16:28,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:28,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:16:28,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:29,293 INFO L124 PetriNetUnfolderBase]: 455/810 cut-off events. [2024-06-04 17:16:29,293 INFO L125 PetriNetUnfolderBase]: For 46501/46501 co-relation queries the response was YES. [2024-06-04 17:16:29,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 810 events. 455/810 cut-off events. For 46501/46501 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3536 event pairs, 114 based on Foata normal form. 1/811 useless extension candidates. Maximal degree in co-relation 5929. Up to 671 conditions per place. [2024-06-04 17:16:29,301 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 143 selfloop transitions, 33 changer transitions 0/201 dead transitions. [2024-06-04 17:16:29,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 201 transitions, 2375 flow [2024-06-04 17:16:29,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:29,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:29,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:16:29,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-04 17:16:29,305 INFO L175 Difference]: Start difference. First operand has 178 places, 177 transitions, 1781 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:16:29,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 201 transitions, 2375 flow [2024-06-04 17:16:29,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 201 transitions, 2363 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:16:29,385 INFO L231 Difference]: Finished difference. Result has 188 places, 186 transitions, 1985 flow [2024-06-04 17:16:29,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1985, PETRI_PLACES=188, PETRI_TRANSITIONS=186} [2024-06-04 17:16:29,386 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 155 predicate places. [2024-06-04 17:16:29,386 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 1985 flow [2024-06-04 17:16:29,386 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 17:16:29,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:29,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 17:16:29,387 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 17:16:29,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash 181232226, now seen corresponding path program 6 times [2024-06-04 17:16:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:29,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923791955] [2024-06-04 17:16:29,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:29,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:40,909 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 17:16:40,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:40,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923791955] [2024-06-04 17:16:40,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923791955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:40,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:40,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933208298] [2024-06-04 17:16:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:40,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:40,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:40,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:41,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:16:41,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 1985 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 17:16:41,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:41,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:16:41,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:41,503 INFO L124 PetriNetUnfolderBase]: 480/840 cut-off events. [2024-06-04 17:16:41,504 INFO L125 PetriNetUnfolderBase]: For 49702/49702 co-relation queries the response was YES. [2024-06-04 17:16:41,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6418 conditions, 840 events. 480/840 cut-off events. For 49702/49702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3639 event pairs, 124 based on Foata normal form. 1/841 useless extension candidates. Maximal degree in co-relation 6331. Up to 734 conditions per place. [2024-06-04 17:16:41,511 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 161 selfloop transitions, 42 changer transitions 0/205 dead transitions. [2024-06-04 17:16:41,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 205 transitions, 2645 flow [2024-06-04 17:16:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:16:41,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-04 17:16:41,520 INFO L175 Difference]: Start difference. First operand has 188 places, 186 transitions, 1985 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:16:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 205 transitions, 2645 flow [2024-06-04 17:16:41,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 205 transitions, 2598 flow, removed 17 selfloop flow, removed 3 redundant places. [2024-06-04 17:16:41,603 INFO L231 Difference]: Finished difference. Result has 195 places, 190 transitions, 2067 flow [2024-06-04 17:16:41,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=1938, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2067, PETRI_PLACES=195, PETRI_TRANSITIONS=190} [2024-06-04 17:16:41,604 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 162 predicate places. [2024-06-04 17:16:41,605 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 190 transitions, 2067 flow [2024-06-04 17:16:41,605 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 17:16:41,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:41,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:41,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 17:16:41,605 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 17:16:41,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:41,606 INFO L85 PathProgramCache]: Analyzing trace with hash 347466254, now seen corresponding path program 2 times [2024-06-04 17:16:41,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:41,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484184415] [2024-06-04 17:16:41,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:41,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:16:52,884 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 17:16:52,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:16:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484184415] [2024-06-04 17:16:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484184415] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:16:52,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:16:52,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:16:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608716607] [2024-06-04 17:16:52,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:16:52,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:16:52,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:16:52,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:16:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:16:53,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:16:53,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 190 transitions, 2067 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 17:16:53,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:16:53,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:16:53,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:16:53,548 INFO L124 PetriNetUnfolderBase]: 513/894 cut-off events. [2024-06-04 17:16:53,548 INFO L125 PetriNetUnfolderBase]: For 57191/57191 co-relation queries the response was YES. [2024-06-04 17:16:53,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6882 conditions, 894 events. 513/894 cut-off events. For 57191/57191 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3938 event pairs, 130 based on Foata normal form. 3/897 useless extension candidates. Maximal degree in co-relation 6793. Up to 765 conditions per place. [2024-06-04 17:16:53,554 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 176 selfloop transitions, 41 changer transitions 0/219 dead transitions. [2024-06-04 17:16:53,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 219 transitions, 2727 flow [2024-06-04 17:16:53,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:16:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:16:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-04 17:16:53,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38823529411764707 [2024-06-04 17:16:53,555 INFO L175 Difference]: Start difference. First operand has 195 places, 190 transitions, 2067 flow. Second operand 10 states and 132 transitions. [2024-06-04 17:16:53,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 219 transitions, 2727 flow [2024-06-04 17:16:53,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 219 transitions, 2667 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-04 17:16:53,645 INFO L231 Difference]: Finished difference. Result has 202 places, 200 transitions, 2215 flow [2024-06-04 17:16:53,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2007, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2215, PETRI_PLACES=202, PETRI_TRANSITIONS=200} [2024-06-04 17:16:53,645 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 169 predicate places. [2024-06-04 17:16:53,645 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 200 transitions, 2215 flow [2024-06-04 17:16:53,646 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 17:16:53,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:16:53,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:16:53,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 17:16:53,646 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 17:16:53,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:16:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 181225530, now seen corresponding path program 8 times [2024-06-04 17:16:53,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:16:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461874265] [2024-06-04 17:16:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:16:53,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:16:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:05,147 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 17:17:05,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:05,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461874265] [2024-06-04 17:17:05,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461874265] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:05,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:05,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:05,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838518257] [2024-06-04 17:17:05,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:05,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:05,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:17:05,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 200 transitions, 2215 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 17:17:05,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:05,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:17:05,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:05,686 INFO L124 PetriNetUnfolderBase]: 496/879 cut-off events. [2024-06-04 17:17:05,687 INFO L125 PetriNetUnfolderBase]: For 58205/58205 co-relation queries the response was YES. [2024-06-04 17:17:05,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6982 conditions, 879 events. 496/879 cut-off events. For 58205/58205 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3939 event pairs, 116 based on Foata normal form. 1/880 useless extension candidates. Maximal degree in co-relation 6890. Up to 734 conditions per place. [2024-06-04 17:17:05,695 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 155 selfloop transitions, 34 changer transitions 0/216 dead transitions. [2024-06-04 17:17:05,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 216 transitions, 2757 flow [2024-06-04 17:17:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-04 17:17:05,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38529411764705884 [2024-06-04 17:17:05,699 INFO L175 Difference]: Start difference. First operand has 202 places, 200 transitions, 2215 flow. Second operand 10 states and 131 transitions. [2024-06-04 17:17:05,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 216 transitions, 2757 flow [2024-06-04 17:17:05,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 216 transitions, 2728 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-04 17:17:05,816 INFO L231 Difference]: Finished difference. Result has 210 places, 202 transitions, 2295 flow [2024-06-04 17:17:05,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2186, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=210, PETRI_TRANSITIONS=202} [2024-06-04 17:17:05,817 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 177 predicate places. [2024-06-04 17:17:05,817 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 202 transitions, 2295 flow [2024-06-04 17:17:05,817 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 17:17:05,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:05,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:05,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 17:17:05,817 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 17:17:05,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:05,818 INFO L85 PathProgramCache]: Analyzing trace with hash 181225716, now seen corresponding path program 7 times [2024-06-04 17:17:05,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:05,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656869950] [2024-06-04 17:17:05,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:05,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:17,162 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 17:17:17,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:17,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656869950] [2024-06-04 17:17:17,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656869950] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:17,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:17,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:17,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234868006] [2024-06-04 17:17:17,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:17,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:17,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:17,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:17,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:17,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:17:17,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 202 transitions, 2295 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 17:17:17,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:17,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:17:17,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:17,766 INFO L124 PetriNetUnfolderBase]: 514/896 cut-off events. [2024-06-04 17:17:17,766 INFO L125 PetriNetUnfolderBase]: For 59162/59162 co-relation queries the response was YES. [2024-06-04 17:17:17,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7142 conditions, 896 events. 514/896 cut-off events. For 59162/59162 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3954 event pairs, 126 based on Foata normal form. 1/897 useless extension candidates. Maximal degree in co-relation 7048. Up to 791 conditions per place. [2024-06-04 17:17:17,777 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 173 selfloop transitions, 41 changer transitions 0/216 dead transitions. [2024-06-04 17:17:17,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 2853 flow [2024-06-04 17:17:17,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:17:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:17:17,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-04 17:17:17,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37058823529411766 [2024-06-04 17:17:17,778 INFO L175 Difference]: Start difference. First operand has 210 places, 202 transitions, 2295 flow. Second operand 10 states and 126 transitions. [2024-06-04 17:17:17,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 2853 flow [2024-06-04 17:17:17,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 216 transitions, 2766 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:17:17,912 INFO L231 Difference]: Finished difference. Result has 213 places, 202 transitions, 2295 flow [2024-06-04 17:17:17,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2208, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2295, PETRI_PLACES=213, PETRI_TRANSITIONS=202} [2024-06-04 17:17:17,912 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 180 predicate places. [2024-06-04 17:17:17,912 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 202 transitions, 2295 flow [2024-06-04 17:17:17,913 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 17:17:17,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:17,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:17,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 17:17:17,913 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 17:17:17,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:17,913 INFO L85 PathProgramCache]: Analyzing trace with hash 182169714, now seen corresponding path program 3 times [2024-06-04 17:17:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54691799] [2024-06-04 17:17:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:29,304 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 17:17:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54691799] [2024-06-04 17:17:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54691799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:29,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:29,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:29,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509089868] [2024-06-04 17:17:29,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:29,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:29,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:29,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:29,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:29,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:17:29,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 202 transitions, 2295 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 17:17:29,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:29,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:17:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:29,986 INFO L124 PetriNetUnfolderBase]: 523/911 cut-off events. [2024-06-04 17:17:29,986 INFO L125 PetriNetUnfolderBase]: For 64034/64034 co-relation queries the response was YES. [2024-06-04 17:17:30,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7260 conditions, 911 events. 523/911 cut-off events. For 64034/64034 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4035 event pairs, 125 based on Foata normal form. 3/914 useless extension candidates. Maximal degree in co-relation 7165. Up to 775 conditions per place. [2024-06-04 17:17:30,006 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 181 selfloop transitions, 45 changer transitions 0/228 dead transitions. [2024-06-04 17:17:30,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 2939 flow [2024-06-04 17:17:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:17:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:17:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2024-06-04 17:17:30,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:17:30,007 INFO L175 Difference]: Start difference. First operand has 213 places, 202 transitions, 2295 flow. Second operand 12 states and 152 transitions. [2024-06-04 17:17:30,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 2939 flow [2024-06-04 17:17:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 228 transitions, 2851 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-04 17:17:30,167 INFO L231 Difference]: Finished difference. Result has 216 places, 205 transitions, 2336 flow [2024-06-04 17:17:30,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2207, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2336, PETRI_PLACES=216, PETRI_TRANSITIONS=205} [2024-06-04 17:17:30,167 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 183 predicate places. [2024-06-04 17:17:30,168 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 205 transitions, 2336 flow [2024-06-04 17:17:30,168 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 17:17:30,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:30,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:30,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 17:17:30,168 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 17:17:30,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:30,169 INFO L85 PathProgramCache]: Analyzing trace with hash -427354394, now seen corresponding path program 8 times [2024-06-04 17:17:30,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:30,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984300673] [2024-06-04 17:17:30,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:30,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:40,980 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 17:17:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:40,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984300673] [2024-06-04 17:17:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984300673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:40,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632276191] [2024-06-04 17:17:40,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:40,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:40,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:40,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:41,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:17:41,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 205 transitions, 2336 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 17:17:41,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:41,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:17:41,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:41,592 INFO L124 PetriNetUnfolderBase]: 531/924 cut-off events. [2024-06-04 17:17:41,592 INFO L125 PetriNetUnfolderBase]: For 65460/65460 co-relation queries the response was YES. [2024-06-04 17:17:41,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7454 conditions, 924 events. 531/924 cut-off events. For 65460/65460 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4101 event pairs, 124 based on Foata normal form. 1/925 useless extension candidates. Maximal degree in co-relation 7358. Up to 816 conditions per place. [2024-06-04 17:17:41,601 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 178 selfloop transitions, 46 changer transitions 0/226 dead transitions. [2024-06-04 17:17:41,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 226 transitions, 3066 flow [2024-06-04 17:17:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:17:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:17:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 144 transitions. [2024-06-04 17:17:41,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2024-06-04 17:17:41,624 INFO L175 Difference]: Start difference. First operand has 216 places, 205 transitions, 2336 flow. Second operand 12 states and 144 transitions. [2024-06-04 17:17:41,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 226 transitions, 3066 flow [2024-06-04 17:17:41,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 226 transitions, 2963 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-04 17:17:41,750 INFO L231 Difference]: Finished difference. Result has 220 places, 209 transitions, 2374 flow [2024-06-04 17:17:41,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2233, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=220, PETRI_TRANSITIONS=209} [2024-06-04 17:17:41,753 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 187 predicate places. [2024-06-04 17:17:41,754 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 209 transitions, 2374 flow [2024-06-04 17:17:41,754 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 17:17:41,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:41,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:41,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 17:17:41,754 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 17:17:41,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash -427360904, now seen corresponding path program 9 times [2024-06-04 17:17:41,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:41,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196245929] [2024-06-04 17:17:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:41,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:17:53,213 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 17:17:53,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:17:53,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196245929] [2024-06-04 17:17:53,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196245929] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:17:53,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:17:53,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:17:53,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874763655] [2024-06-04 17:17:53,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:17:53,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:17:53,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:17:53,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:17:53,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:17:53,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:17:53,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 209 transitions, 2374 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 17:17:53,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:17:53,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:17:53,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:17:53,845 INFO L124 PetriNetUnfolderBase]: 529/921 cut-off events. [2024-06-04 17:17:53,846 INFO L125 PetriNetUnfolderBase]: For 66628/66628 co-relation queries the response was YES. [2024-06-04 17:17:53,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7413 conditions, 921 events. 529/921 cut-off events. For 66628/66628 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4082 event pairs, 124 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 7316. Up to 814 conditions per place. [2024-06-04 17:17:53,856 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 47 changer transitions 0/225 dead transitions. [2024-06-04 17:17:53,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 225 transitions, 2960 flow [2024-06-04 17:17:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:17:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:17:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 142 transitions. [2024-06-04 17:17:53,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3480392156862745 [2024-06-04 17:17:53,859 INFO L175 Difference]: Start difference. First operand has 220 places, 209 transitions, 2374 flow. Second operand 12 states and 142 transitions. [2024-06-04 17:17:53,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 225 transitions, 2960 flow [2024-06-04 17:17:54,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 225 transitions, 2861 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:17:54,037 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2374 flow [2024-06-04 17:17:54,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2275, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2374, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-04 17:17:54,037 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-04 17:17:54,037 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2374 flow [2024-06-04 17:17:54,037 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 17:17:54,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:17:54,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:17:54,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 17:17:54,038 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 17:17:54,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:17:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1210211366, now seen corresponding path program 9 times [2024-06-04 17:17:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:17:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687084283] [2024-06-04 17:17:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:17:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:17:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:05,342 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 17:18:05,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:05,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687084283] [2024-06-04 17:18:05,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687084283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:05,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739824562] [2024-06-04 17:18:05,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:05,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:05,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:05,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:18:05,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2374 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 17:18:05,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:05,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:18:05,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:05,975 INFO L124 PetriNetUnfolderBase]: 507/898 cut-off events. [2024-06-04 17:18:05,976 INFO L125 PetriNetUnfolderBase]: For 68019/68019 co-relation queries the response was YES. [2024-06-04 17:18:05,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7270 conditions, 898 events. 507/898 cut-off events. For 68019/68019 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 4051 event pairs, 116 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 7172. Up to 751 conditions per place. [2024-06-04 17:18:05,984 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 160 selfloop transitions, 35 changer transitions 0/224 dead transitions. [2024-06-04 17:18:05,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 224 transitions, 2802 flow [2024-06-04 17:18:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:18:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:18:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 148 transitions. [2024-06-04 17:18:05,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-04 17:18:05,985 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2374 flow. Second operand 12 states and 148 transitions. [2024-06-04 17:18:05,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 224 transitions, 2802 flow [2024-06-04 17:18:06,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 2668 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-04 17:18:06,159 INFO L231 Difference]: Finished difference. Result has 223 places, 209 transitions, 2315 flow [2024-06-04 17:18:06,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2240, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2315, PETRI_PLACES=223, PETRI_TRANSITIONS=209} [2024-06-04 17:18:06,160 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 190 predicate places. [2024-06-04 17:18:06,160 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 209 transitions, 2315 flow [2024-06-04 17:18:06,160 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 17:18:06,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:06,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:06,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 17:18:06,161 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 17:18:06,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1210457320, now seen corresponding path program 4 times [2024-06-04 17:18:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699009687] [2024-06-04 17:18:06,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:06,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:17,807 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 17:18:17,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699009687] [2024-06-04 17:18:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699009687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:17,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849887238] [2024-06-04 17:18:17,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:17,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:17,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:17,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:17,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:18:17,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 209 transitions, 2315 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 17:18:17,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:17,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:18:17,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:18,729 INFO L124 PetriNetUnfolderBase]: 536/933 cut-off events. [2024-06-04 17:18:18,729 INFO L125 PetriNetUnfolderBase]: For 72790/72790 co-relation queries the response was YES. [2024-06-04 17:18:18,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7461 conditions, 933 events. 536/933 cut-off events. For 72790/72790 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4174 event pairs, 125 based on Foata normal form. 3/936 useless extension candidates. Maximal degree in co-relation 7362. Up to 790 conditions per place. [2024-06-04 17:18:18,736 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 180 selfloop transitions, 53 changer transitions 0/235 dead transitions. [2024-06-04 17:18:18,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 2978 flow [2024-06-04 17:18:18,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-04 17:18:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-04 17:18:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2024-06-04 17:18:18,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3403361344537815 [2024-06-04 17:18:18,746 INFO L175 Difference]: Start difference. First operand has 223 places, 209 transitions, 2315 flow. Second operand 14 states and 162 transitions. [2024-06-04 17:18:18,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 2978 flow [2024-06-04 17:18:18,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 235 transitions, 2879 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-04 17:18:18,910 INFO L231 Difference]: Finished difference. Result has 226 places, 212 transitions, 2362 flow [2024-06-04 17:18:18,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2216, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2362, PETRI_PLACES=226, PETRI_TRANSITIONS=212} [2024-06-04 17:18:18,911 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-04 17:18:18,911 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 212 transitions, 2362 flow [2024-06-04 17:18:18,911 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 17:18:18,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:18,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 17:18:18,912 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 17:18:18,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash -427123754, now seen corresponding path program 10 times [2024-06-04 17:18:18,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:18,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695194912] [2024-06-04 17:18:18,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:18,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:30,268 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 17:18:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695194912] [2024-06-04 17:18:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695194912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:30,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:30,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:30,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383897637] [2024-06-04 17:18:30,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:30,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:30,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:30,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:30,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:18:30,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 212 transitions, 2362 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 17:18:30,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:30,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:18:30,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:30,999 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-04 17:18:31,000 INFO L125 PetriNetUnfolderBase]: For 71406/71406 co-relation queries the response was YES. [2024-06-04 17:18:31,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7490 conditions, 930 events. 534/930 cut-off events. For 71406/71406 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4156 event pairs, 124 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7390. Up to 824 conditions per place. [2024-06-04 17:18:31,008 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 176 selfloop transitions, 50 changer transitions 0/228 dead transitions. [2024-06-04 17:18:31,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 228 transitions, 2854 flow [2024-06-04 17:18:31,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:18:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:18:31,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 147 transitions. [2024-06-04 17:18:31,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.332579185520362 [2024-06-04 17:18:31,009 INFO L175 Difference]: Start difference. First operand has 226 places, 212 transitions, 2362 flow. Second operand 13 states and 147 transitions. [2024-06-04 17:18:31,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 228 transitions, 2854 flow [2024-06-04 17:18:31,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 2745 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-04 17:18:31,183 INFO L231 Difference]: Finished difference. Result has 229 places, 212 transitions, 2358 flow [2024-06-04 17:18:31,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2253, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2358, PETRI_PLACES=229, PETRI_TRANSITIONS=212} [2024-06-04 17:18:31,184 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 196 predicate places. [2024-06-04 17:18:31,184 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 212 transitions, 2358 flow [2024-06-04 17:18:31,185 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 17:18:31,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:31,185 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:31,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 17:18:31,185 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 17:18:31,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1210448950, now seen corresponding path program 5 times [2024-06-04 17:18:31,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:31,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042895857] [2024-06-04 17:18:31,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:31,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:42,074 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 17:18:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042895857] [2024-06-04 17:18:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042895857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:42,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777273905] [2024-06-04 17:18:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:42,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:42,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:42,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:18:42,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 212 transitions, 2358 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 17:18:42,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:42,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:18:42,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:42,770 INFO L124 PetriNetUnfolderBase]: 528/921 cut-off events. [2024-06-04 17:18:42,771 INFO L125 PetriNetUnfolderBase]: For 72376/72376 co-relation queries the response was YES. [2024-06-04 17:18:42,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7298 conditions, 921 events. 528/921 cut-off events. For 72376/72376 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4092 event pairs, 123 based on Foata normal form. 3/924 useless extension candidates. Maximal degree in co-relation 7197. Up to 783 conditions per place. [2024-06-04 17:18:42,781 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 183 selfloop transitions, 50 changer transitions 0/235 dead transitions. [2024-06-04 17:18:42,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 235 transitions, 2887 flow [2024-06-04 17:18:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-04 17:18:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-04 17:18:42,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2024-06-04 17:18:42,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3552036199095023 [2024-06-04 17:18:42,782 INFO L175 Difference]: Start difference. First operand has 229 places, 212 transitions, 2358 flow. Second operand 13 states and 157 transitions. [2024-06-04 17:18:42,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 235 transitions, 2887 flow [2024-06-04 17:18:42,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 235 transitions, 2750 flow, removed 5 selfloop flow, removed 14 redundant places. [2024-06-04 17:18:42,957 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 2327 flow [2024-06-04 17:18:42,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2221, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2327, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2024-06-04 17:18:42,958 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 195 predicate places. [2024-06-04 17:18:42,958 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 2327 flow [2024-06-04 17:18:42,958 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 17:18:42,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:42,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:42,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 17:18:42,958 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 17:18:42,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:42,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1956790796, now seen corresponding path program 10 times [2024-06-04 17:18:42,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:42,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204060419] [2024-06-04 17:18:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:18:52,111 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 17:18:52,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:18:52,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204060419] [2024-06-04 17:18:52,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204060419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:18:52,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:18:52,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:18:52,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261263247] [2024-06-04 17:18:52,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:18:52,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:18:52,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:18:52,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:18:52,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:18:52,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:18:52,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 2327 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 17:18:52,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:18:52,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:18:52,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:18:52,859 INFO L124 PetriNetUnfolderBase]: 511/906 cut-off events. [2024-06-04 17:18:52,859 INFO L125 PetriNetUnfolderBase]: For 75185/75186 co-relation queries the response was YES. [2024-06-04 17:18:52,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7318 conditions, 906 events. 511/906 cut-off events. For 75185/75186 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4135 event pairs, 101 based on Foata normal form. 1/906 useless extension candidates. Maximal degree in co-relation 7216. Up to 737 conditions per place. [2024-06-04 17:18:52,868 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 158 selfloop transitions, 43 changer transitions 0/230 dead transitions. [2024-06-04 17:18:52,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 230 transitions, 2809 flow [2024-06-04 17:18:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:18:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:18:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:18:52,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:18:52,870 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 2327 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:18:52,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 230 transitions, 2809 flow [2024-06-04 17:18:53,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 230 transitions, 2688 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-04 17:18:53,011 INFO L231 Difference]: Finished difference. Result has 224 places, 214 transitions, 2351 flow [2024-06-04 17:18:53,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2206, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2351, PETRI_PLACES=224, PETRI_TRANSITIONS=214} [2024-06-04 17:18:53,011 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 191 predicate places. [2024-06-04 17:18:53,011 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 214 transitions, 2351 flow [2024-06-04 17:18:53,012 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 17:18:53,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:18:53,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:18:53,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 17:18:53,012 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 17:18:53,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:18:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670640, now seen corresponding path program 11 times [2024-06-04 17:18:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:18:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583533573] [2024-06-04 17:18:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:18:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:18:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:01,665 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 17:19:01,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:01,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583533573] [2024-06-04 17:19:01,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583533573] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:01,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:01,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:01,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150149008] [2024-06-04 17:19:01,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:01,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:01,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:01,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:01,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:19:01,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 214 transitions, 2351 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 17:19:01,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:01,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:19:01,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:02,242 INFO L124 PetriNetUnfolderBase]: 534/930 cut-off events. [2024-06-04 17:19:02,242 INFO L125 PetriNetUnfolderBase]: For 74224/74224 co-relation queries the response was YES. [2024-06-04 17:19:02,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7478 conditions, 930 events. 534/930 cut-off events. For 74224/74224 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4174 event pairs, 96 based on Foata normal form. 1/931 useless extension candidates. Maximal degree in co-relation 7375. Up to 709 conditions per place. [2024-06-04 17:19:02,250 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 134 selfloop transitions, 95 changer transitions 0/231 dead transitions. [2024-06-04 17:19:02,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 231 transitions, 2977 flow [2024-06-04 17:19:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:19:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:19:02,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:19:02,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:19:02,251 INFO L175 Difference]: Start difference. First operand has 224 places, 214 transitions, 2351 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:19:02,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 231 transitions, 2977 flow [2024-06-04 17:19:02,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 231 transitions, 2882 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:02,425 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 2480 flow [2024-06-04 17:19:02,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2480, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2024-06-04 17:19:02,425 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2024-06-04 17:19:02,426 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 2480 flow [2024-06-04 17:19:02,426 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 17:19:02,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:02,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:02,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 17:19:02,426 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 17:19:02,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1956670826, now seen corresponding path program 11 times [2024-06-04 17:19:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:02,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128286337] [2024-06-04 17:19:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:10,998 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 17:19:10,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:10,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128286337] [2024-06-04 17:19:10,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128286337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:10,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:10,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:10,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659177610] [2024-06-04 17:19:10,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:10,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:10,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:10,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:11,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:11,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:11,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 2480 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 17:19:11,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:11,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:11,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:11,614 INFO L124 PetriNetUnfolderBase]: 519/919 cut-off events. [2024-06-04 17:19:11,614 INFO L125 PetriNetUnfolderBase]: For 80856/80858 co-relation queries the response was YES. [2024-06-04 17:19:11,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7596 conditions, 919 events. 519/919 cut-off events. For 80856/80858 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4220 event pairs, 91 based on Foata normal form. 1/917 useless extension candidates. Maximal degree in co-relation 7492. Up to 659 conditions per place. [2024-06-04 17:19:11,622 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 122 selfloop transitions, 83 changer transitions 0/235 dead transitions. [2024-06-04 17:19:11,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 235 transitions, 3116 flow [2024-06-04 17:19:11,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:19:11,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:19:11,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:19:11,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-04 17:19:11,623 INFO L175 Difference]: Start difference. First operand has 226 places, 216 transitions, 2480 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:19:11,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 235 transitions, 3116 flow [2024-06-04 17:19:11,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 235 transitions, 2955 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-04 17:19:11,790 INFO L231 Difference]: Finished difference. Result has 225 places, 220 transitions, 2585 flow [2024-06-04 17:19:11,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2585, PETRI_PLACES=225, PETRI_TRANSITIONS=220} [2024-06-04 17:19:11,791 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 192 predicate places. [2024-06-04 17:19:11,791 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 220 transitions, 2585 flow [2024-06-04 17:19:11,791 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 17:19:11,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:11,791 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 17:19:11,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 17:19:11,791 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 17:19:11,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:11,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1359300669, now seen corresponding path program 1 times [2024-06-04 17:19:11,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:11,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447975426] [2024-06-04 17:19:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:11,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:23,317 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 17:19:23,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:23,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447975426] [2024-06-04 17:19:23,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447975426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:23,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:23,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:19:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999079190] [2024-06-04 17:19:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:23,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:19:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:19:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:19:23,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:19:23,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 220 transitions, 2585 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 17:19:23,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:23,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:19:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:24,304 INFO L124 PetriNetUnfolderBase]: 576/998 cut-off events. [2024-06-04 17:19:24,305 INFO L125 PetriNetUnfolderBase]: For 81656/81656 co-relation queries the response was YES. [2024-06-04 17:19:24,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8107 conditions, 998 events. 576/998 cut-off events. For 81656/81656 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4551 event pairs, 105 based on Foata normal form. 3/1001 useless extension candidates. Maximal degree in co-relation 8006. Up to 641 conditions per place. [2024-06-04 17:19:24,314 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 182 selfloop transitions, 69 changer transitions 0/253 dead transitions. [2024-06-04 17:19:24,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 253 transitions, 3551 flow [2024-06-04 17:19:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:19:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:19:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 151 transitions. [2024-06-04 17:19:24,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037433155080214 [2024-06-04 17:19:24,316 INFO L175 Difference]: Start difference. First operand has 225 places, 220 transitions, 2585 flow. Second operand 11 states and 151 transitions. [2024-06-04 17:19:24,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 253 transitions, 3551 flow [2024-06-04 17:19:24,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 253 transitions, 3430 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:24,456 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 2723 flow [2024-06-04 17:19:24,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2476, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2723, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2024-06-04 17:19:24,457 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 197 predicate places. [2024-06-04 17:19:24,457 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 2723 flow [2024-06-04 17:19:24,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 17:19:24,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:24,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:24,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 17:19:24,458 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 17:19:24,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945408, now seen corresponding path program 12 times [2024-06-04 17:19:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:24,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186904378] [2024-06-04 17:19:24,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:24,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:32,252 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 17:19:32,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:32,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186904378] [2024-06-04 17:19:32,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186904378] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:32,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:32,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:32,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428503159] [2024-06-04 17:19:32,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:32,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:32,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:32,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:32,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:32,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:19:32,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 228 transitions, 2723 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 17:19:32,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:32,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:19:32,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:32,761 INFO L124 PetriNetUnfolderBase]: 584/1012 cut-off events. [2024-06-04 17:19:32,762 INFO L125 PetriNetUnfolderBase]: For 77550/77550 co-relation queries the response was YES. [2024-06-04 17:19:32,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8355 conditions, 1012 events. 584/1012 cut-off events. For 77550/77550 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4596 event pairs, 102 based on Foata normal form. 1/1013 useless extension candidates. Maximal degree in co-relation 8253. Up to 787 conditions per place. [2024-06-04 17:19:32,770 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 152 selfloop transitions, 92 changer transitions 0/246 dead transitions. [2024-06-04 17:19:32,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 246 transitions, 3503 flow [2024-06-04 17:19:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:19:32,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:19:32,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-04 17:19:32,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2024-06-04 17:19:32,771 INFO L175 Difference]: Start difference. First operand has 230 places, 228 transitions, 2723 flow. Second operand 9 states and 125 transitions. [2024-06-04 17:19:32,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 246 transitions, 3503 flow [2024-06-04 17:19:32,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 246 transitions, 3441 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-04 17:19:32,928 INFO L231 Difference]: Finished difference. Result has 234 places, 232 transitions, 2902 flow [2024-06-04 17:19:32,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2902, PETRI_PLACES=234, PETRI_TRANSITIONS=232} [2024-06-04 17:19:32,929 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 201 predicate places. [2024-06-04 17:19:32,929 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 232 transitions, 2902 flow [2024-06-04 17:19:32,929 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 17:19:32,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:32,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:32,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 17:19:32,930 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 17:19:32,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:32,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1082945160, now seen corresponding path program 6 times [2024-06-04 17:19:32,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:32,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449452750] [2024-06-04 17:19:32,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:32,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:40,854 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 17:19:40,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:40,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449452750] [2024-06-04 17:19:40,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449452750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:40,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:40,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:40,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953342725] [2024-06-04 17:19:40,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:40,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:40,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:41,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:19:41,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 232 transitions, 2902 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 17:19:41,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:41,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:19:41,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:41,506 INFO L124 PetriNetUnfolderBase]: 603/1043 cut-off events. [2024-06-04 17:19:41,506 INFO L125 PetriNetUnfolderBase]: For 86615/86615 co-relation queries the response was YES. [2024-06-04 17:19:41,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8806 conditions, 1043 events. 603/1043 cut-off events. For 86615/86615 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4788 event pairs, 184 based on Foata normal form. 3/1046 useless extension candidates. Maximal degree in co-relation 8702. Up to 875 conditions per place. [2024-06-04 17:19:41,519 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 207 selfloop transitions, 46 changer transitions 0/255 dead transitions. [2024-06-04 17:19:41,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 255 transitions, 3675 flow [2024-06-04 17:19:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:19:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:19:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-04 17:19:41,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36470588235294116 [2024-06-04 17:19:41,520 INFO L175 Difference]: Start difference. First operand has 234 places, 232 transitions, 2902 flow. Second operand 10 states and 124 transitions. [2024-06-04 17:19:41,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 255 transitions, 3675 flow [2024-06-04 17:19:41,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 3547 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 17:19:41,696 INFO L231 Difference]: Finished difference. Result has 239 places, 239 transitions, 3041 flow [2024-06-04 17:19:41,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2779, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3041, PETRI_PLACES=239, PETRI_TRANSITIONS=239} [2024-06-04 17:19:41,697 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 206 predicate places. [2024-06-04 17:19:41,697 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 239 transitions, 3041 flow [2024-06-04 17:19:41,697 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 17:19:41,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:41,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:41,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 17:19:41,698 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 17:19:41,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1952029010, now seen corresponding path program 13 times [2024-06-04 17:19:41,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:41,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764875644] [2024-06-04 17:19:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:19:50,331 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 17:19:50,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:19:50,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764875644] [2024-06-04 17:19:50,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764875644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:19:50,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:19:50,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:19:50,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582429640] [2024-06-04 17:19:50,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:19:50,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:19:50,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:19:50,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:19:50,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:19:50,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:19:50,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 239 transitions, 3041 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 17:19:50,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:19:50,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:19:50,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:19:51,012 INFO L124 PetriNetUnfolderBase]: 601/1040 cut-off events. [2024-06-04 17:19:51,012 INFO L125 PetriNetUnfolderBase]: For 79605/79605 co-relation queries the response was YES. [2024-06-04 17:19:51,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8752 conditions, 1040 events. 601/1040 cut-off events. For 79605/79605 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4757 event pairs, 105 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 8647. Up to 816 conditions per place. [2024-06-04 17:19:51,025 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 161 selfloop transitions, 89 changer transitions 0/252 dead transitions. [2024-06-04 17:19:51,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 252 transitions, 3679 flow [2024-06-04 17:19:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:19:51,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:19:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-04 17:19:51,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790849673202614 [2024-06-04 17:19:51,028 INFO L175 Difference]: Start difference. First operand has 239 places, 239 transitions, 3041 flow. Second operand 9 states and 116 transitions. [2024-06-04 17:19:51,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 252 transitions, 3679 flow [2024-06-04 17:19:51,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 252 transitions, 3593 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 17:19:51,236 INFO L231 Difference]: Finished difference. Result has 242 places, 239 transitions, 3144 flow [2024-06-04 17:19:51,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2955, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3144, PETRI_PLACES=242, PETRI_TRANSITIONS=239} [2024-06-04 17:19:51,237 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-04 17:19:51,237 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 3144 flow [2024-06-04 17:19:51,237 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 17:19:51,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:19:51,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:19:51,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 17:19:51,238 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 17:19:51,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:19:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1794847348, now seen corresponding path program 12 times [2024-06-04 17:19:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:19:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499603512] [2024-06-04 17:19:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:19:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:19:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:00,496 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 17:20:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:00,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499603512] [2024-06-04 17:20:00,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499603512] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:00,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:00,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:00,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237481950] [2024-06-04 17:20:00,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:00,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:00,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:00,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:20:00,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 239 transitions, 3144 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 17:20:00,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:20:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:01,147 INFO L124 PetriNetUnfolderBase]: 580/1019 cut-off events. [2024-06-04 17:20:01,147 INFO L125 PetriNetUnfolderBase]: For 83151/83151 co-relation queries the response was YES. [2024-06-04 17:20:01,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8816 conditions, 1019 events. 580/1019 cut-off events. For 83151/83151 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4722 event pairs, 74 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 8710. Up to 755 conditions per place. [2024-06-04 17:20:01,158 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 140 selfloop transitions, 82 changer transitions 0/254 dead transitions. [2024-06-04 17:20:01,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 254 transitions, 3766 flow [2024-06-04 17:20:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-04 17:20:01,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954248366013072 [2024-06-04 17:20:01,159 INFO L175 Difference]: Start difference. First operand has 242 places, 239 transitions, 3144 flow. Second operand 9 states and 121 transitions. [2024-06-04 17:20:01,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 254 transitions, 3766 flow [2024-06-04 17:20:01,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 254 transitions, 3553 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 17:20:01,336 INFO L231 Difference]: Finished difference. Result has 241 places, 241 transitions, 3148 flow [2024-06-04 17:20:01,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2935, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3148, PETRI_PLACES=241, PETRI_TRANSITIONS=241} [2024-06-04 17:20:01,337 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 208 predicate places. [2024-06-04 17:20:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 241 transitions, 3148 flow [2024-06-04 17:20:01,337 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 17:20:01,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:01,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 17:20:01,338 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 17:20:01,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1967583192, now seen corresponding path program 7 times [2024-06-04 17:20:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857997924] [2024-06-04 17:20:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:01,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:09,817 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 17:20:09,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:09,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857997924] [2024-06-04 17:20:09,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857997924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:09,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:09,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737271945] [2024-06-04 17:20:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:09,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:09,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:09,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:09,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:09,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 241 transitions, 3148 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 17:20:09,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:09,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:09,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:10,477 INFO L124 PetriNetUnfolderBase]: 628/1084 cut-off events. [2024-06-04 17:20:10,477 INFO L125 PetriNetUnfolderBase]: For 86870/86870 co-relation queries the response was YES. [2024-06-04 17:20:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 1084 events. 628/1084 cut-off events. For 86870/86870 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5006 event pairs, 118 based on Foata normal form. 3/1087 useless extension candidates. Maximal degree in co-relation 9146. Up to 795 conditions per place. [2024-06-04 17:20:10,488 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 180 selfloop transitions, 84 changer transitions 0/266 dead transitions. [2024-06-04 17:20:10,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 266 transitions, 4031 flow [2024-06-04 17:20:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-04 17:20:10,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39215686274509803 [2024-06-04 17:20:10,489 INFO L175 Difference]: Start difference. First operand has 241 places, 241 transitions, 3148 flow. Second operand 9 states and 120 transitions. [2024-06-04 17:20:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 266 transitions, 4031 flow [2024-06-04 17:20:10,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 266 transitions, 3869 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-04 17:20:10,701 INFO L231 Difference]: Finished difference. Result has 242 places, 247 transitions, 3250 flow [2024-06-04 17:20:10,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=2994, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3250, PETRI_PLACES=242, PETRI_TRANSITIONS=247} [2024-06-04 17:20:10,701 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 209 predicate places. [2024-06-04 17:20:10,701 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 247 transitions, 3250 flow [2024-06-04 17:20:10,702 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 17:20:10,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:10,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:10,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 17:20:10,702 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 17:20:10,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1967343934, now seen corresponding path program 14 times [2024-06-04 17:20:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593581532] [2024-06-04 17:20:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:10,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:18,954 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 17:20:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593581532] [2024-06-04 17:20:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593581532] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:18,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:18,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36890416] [2024-06-04 17:20:18,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:19,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:19,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 3250 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 17:20:19,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:19,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:19,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:19,576 INFO L124 PetriNetUnfolderBase]: 641/1103 cut-off events. [2024-06-04 17:20:19,576 INFO L125 PetriNetUnfolderBase]: For 84475/84475 co-relation queries the response was YES. [2024-06-04 17:20:19,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9436 conditions, 1103 events. 641/1103 cut-off events. For 84475/84475 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5089 event pairs, 84 based on Foata normal form. 1/1104 useless extension candidates. Maximal degree in co-relation 9332. Up to 876 conditions per place. [2024-06-04 17:20:19,588 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 176 selfloop transitions, 88 changer transitions 0/266 dead transitions. [2024-06-04 17:20:19,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 266 transitions, 4195 flow [2024-06-04 17:20:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:20:19,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:20:19,592 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 3250 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:20:19,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 266 transitions, 4195 flow [2024-06-04 17:20:19,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 266 transitions, 4056 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 17:20:19,802 INFO L231 Difference]: Finished difference. Result has 245 places, 253 transitions, 3376 flow [2024-06-04 17:20:19,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3117, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3376, PETRI_PLACES=245, PETRI_TRANSITIONS=253} [2024-06-04 17:20:19,803 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 212 predicate places. [2024-06-04 17:20:19,803 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 253 transitions, 3376 flow [2024-06-04 17:20:19,803 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 17:20:19,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:19,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 17:20:19,803 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 17:20:19,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:19,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1779301970, now seen corresponding path program 15 times [2024-06-04 17:20:19,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:19,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087854685] [2024-06-04 17:20:19,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:19,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:28,196 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 17:20:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:28,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087854685] [2024-06-04 17:20:28,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087854685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:28,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:28,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:28,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998323011] [2024-06-04 17:20:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:28,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:28,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:28,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:28,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:28,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 253 transitions, 3376 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 17:20:28,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:28,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:28,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:28,760 INFO L124 PetriNetUnfolderBase]: 639/1100 cut-off events. [2024-06-04 17:20:28,760 INFO L125 PetriNetUnfolderBase]: For 83421/83421 co-relation queries the response was YES. [2024-06-04 17:20:28,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9354 conditions, 1100 events. 639/1100 cut-off events. For 83421/83421 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 5073 event pairs, 78 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 9250. Up to 874 conditions per place. [2024-06-04 17:20:28,771 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 165 selfloop transitions, 98 changer transitions 0/265 dead transitions. [2024-06-04 17:20:28,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 265 transitions, 4138 flow [2024-06-04 17:20:28,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:20:28,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:20:28,774 INFO L175 Difference]: Start difference. First operand has 245 places, 253 transitions, 3376 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:20:28,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 265 transitions, 4138 flow [2024-06-04 17:20:28,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 265 transitions, 4004 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-04 17:20:28,962 INFO L231 Difference]: Finished difference. Result has 249 places, 253 transitions, 3450 flow [2024-06-04 17:20:28,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3246, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3450, PETRI_PLACES=249, PETRI_TRANSITIONS=253} [2024-06-04 17:20:28,963 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 216 predicate places. [2024-06-04 17:20:28,963 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 253 transitions, 3450 flow [2024-06-04 17:20:28,963 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 17:20:28,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:28,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:28,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 17:20:28,964 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 17:20:28,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -910224630, now seen corresponding path program 8 times [2024-06-04 17:20:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:28,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728753231] [2024-06-04 17:20:28,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:28,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:36,582 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 17:20:36,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:36,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728753231] [2024-06-04 17:20:36,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728753231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:36,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:36,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:36,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149421538] [2024-06-04 17:20:36,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:36,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:36,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:36,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:36,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:36,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:36,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 253 transitions, 3450 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 17:20:36,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:36,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:36,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:37,243 INFO L124 PetriNetUnfolderBase]: 648/1117 cut-off events. [2024-06-04 17:20:37,243 INFO L125 PetriNetUnfolderBase]: For 86670/86670 co-relation queries the response was YES. [2024-06-04 17:20:37,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 1117 events. 648/1117 cut-off events. For 86670/86670 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5219 event pairs, 186 based on Foata normal form. 3/1120 useless extension candidates. Maximal degree in co-relation 9370. Up to 923 conditions per place. [2024-06-04 17:20:37,254 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 227 selfloop transitions, 47 changer transitions 0/276 dead transitions. [2024-06-04 17:20:37,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 276 transitions, 4314 flow [2024-06-04 17:20:37,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 17:20:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 17:20:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-04 17:20:37,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764705882352941 [2024-06-04 17:20:37,256 INFO L175 Difference]: Start difference. First operand has 249 places, 253 transitions, 3450 flow. Second operand 10 states and 128 transitions. [2024-06-04 17:20:37,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 276 transitions, 4314 flow [2024-06-04 17:20:37,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 276 transitions, 4097 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:37,466 INFO L231 Difference]: Finished difference. Result has 250 places, 256 transitions, 3370 flow [2024-06-04 17:20:37,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3237, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3370, PETRI_PLACES=250, PETRI_TRANSITIONS=256} [2024-06-04 17:20:37,467 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 217 predicate places. [2024-06-04 17:20:37,467 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 256 transitions, 3370 flow [2024-06-04 17:20:37,467 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 17:20:37,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:37,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:37,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 17:20:37,468 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 17:20:37,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1967337424, now seen corresponding path program 16 times [2024-06-04 17:20:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:37,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986503471] [2024-06-04 17:20:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:37,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:46,345 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 17:20:46,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:46,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986503471] [2024-06-04 17:20:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986503471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:46,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219623429] [2024-06-04 17:20:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:46,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:46,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:46,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:46,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:46,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 256 transitions, 3370 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 17:20:46,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:46,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:46,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:46,935 INFO L124 PetriNetUnfolderBase]: 646/1112 cut-off events. [2024-06-04 17:20:46,935 INFO L125 PetriNetUnfolderBase]: For 82094/82094 co-relation queries the response was YES. [2024-06-04 17:20:46,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9313 conditions, 1112 events. 646/1112 cut-off events. For 82094/82094 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5138 event pairs, 80 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 9209. Up to 887 conditions per place. [2024-06-04 17:20:46,946 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 175 selfloop transitions, 90 changer transitions 0/267 dead transitions. [2024-06-04 17:20:46,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 267 transitions, 4030 flow [2024-06-04 17:20:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:46,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:46,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:20:46,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:20:46,949 INFO L175 Difference]: Start difference. First operand has 250 places, 256 transitions, 3370 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:20:46,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 267 transitions, 4030 flow [2024-06-04 17:20:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 267 transitions, 3938 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 17:20:47,126 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3466 flow [2024-06-04 17:20:47,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3278, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3466, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-04 17:20:47,127 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-04 17:20:47,127 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3466 flow [2024-06-04 17:20:47,127 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 17:20:47,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:47,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:47,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 17:20:47,128 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 17:20:47,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1779532362, now seen corresponding path program 9 times [2024-06-04 17:20:47,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:47,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315271266] [2024-06-04 17:20:47,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:47,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:20:55,624 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 17:20:55,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:20:55,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315271266] [2024-06-04 17:20:55,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315271266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:20:55,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:20:55,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:20:55,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820749991] [2024-06-04 17:20:55,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:20:55,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:20:55,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:20:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:20:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:20:55,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:20:55,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3466 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 17:20:55,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:20:55,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:20:55,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:20:56,287 INFO L124 PetriNetUnfolderBase]: 640/1106 cut-off events. [2024-06-04 17:20:56,288 INFO L125 PetriNetUnfolderBase]: For 83681/83681 co-relation queries the response was YES. [2024-06-04 17:20:56,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9242 conditions, 1106 events. 640/1106 cut-off events. For 83681/83681 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5137 event pairs, 116 based on Foata normal form. 3/1109 useless extension candidates. Maximal degree in co-relation 9138. Up to 814 conditions per place. [2024-06-04 17:20:56,298 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 195 selfloop transitions, 79 changer transitions 0/276 dead transitions. [2024-06-04 17:20:56,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 276 transitions, 4195 flow [2024-06-04 17:20:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:20:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:20:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-04 17:20:56,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4019607843137255 [2024-06-04 17:20:56,300 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3466 flow. Second operand 9 states and 123 transitions. [2024-06-04 17:20:56,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 276 transitions, 4195 flow [2024-06-04 17:20:56,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 276 transitions, 3994 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-04 17:20:56,495 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 3435 flow [2024-06-04 17:20:56,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3267, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3435, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-06-04 17:20:56,496 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-04 17:20:56,496 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 3435 flow [2024-06-04 17:20:56,496 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 17:20:56,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:20:56,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:20:56,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 17:20:56,497 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 17:20:56,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:20:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1779539306, now seen corresponding path program 13 times [2024-06-04 17:20:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:20:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115297994] [2024-06-04 17:20:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:20:56,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:20:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:05,370 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 17:21:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:05,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115297994] [2024-06-04 17:21:05,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115297994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:05,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:05,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:05,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786151167] [2024-06-04 17:21:05,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:05,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:05,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:05,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:05,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:05,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 3435 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 17:21:05,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:05,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:05,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:05,953 INFO L124 PetriNetUnfolderBase]: 617/1082 cut-off events. [2024-06-04 17:21:05,954 INFO L125 PetriNetUnfolderBase]: For 81572/81572 co-relation queries the response was YES. [2024-06-04 17:21:05,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9141 conditions, 1082 events. 617/1082 cut-off events. For 81572/81572 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5111 event pairs, 79 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 9037. Up to 811 conditions per place. [2024-06-04 17:21:05,965 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 154 selfloop transitions, 80 changer transitions 0/269 dead transitions. [2024-06-04 17:21:05,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 269 transitions, 4075 flow [2024-06-04 17:21:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-04 17:21:05,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 17:21:05,968 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 3435 flow. Second operand 9 states and 119 transitions. [2024-06-04 17:21:05,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 269 transitions, 4075 flow [2024-06-04 17:21:06,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 269 transitions, 3882 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 17:21:06,156 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 3452 flow [2024-06-04 17:21:06,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3244, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3452, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-06-04 17:21:06,157 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 220 predicate places. [2024-06-04 17:21:06,157 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 3452 flow [2024-06-04 17:21:06,157 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 17:21:06,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:06,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:06,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 17:21:06,157 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 17:21:06,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:06,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1690173642, now seen corresponding path program 1 times [2024-06-04 17:21:06,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:06,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228262784] [2024-06-04 17:21:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:14,287 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 17:21:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:14,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228262784] [2024-06-04 17:21:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228262784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371387503] [2024-06-04 17:21:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:14,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:14,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:14,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:14,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 3452 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 17:21:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:14,934 INFO L124 PetriNetUnfolderBase]: 598/1059 cut-off events. [2024-06-04 17:21:14,934 INFO L125 PetriNetUnfolderBase]: For 80925/80930 co-relation queries the response was YES. [2024-06-04 17:21:14,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8777 conditions, 1059 events. 598/1059 cut-off events. For 80925/80930 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5098 event pairs, 165 based on Foata normal form. 7/1060 useless extension candidates. Maximal degree in co-relation 8673. Up to 926 conditions per place. [2024-06-04 17:21:14,946 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 213 selfloop transitions, 15 changer transitions 0/270 dead transitions. [2024-06-04 17:21:14,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 3954 flow [2024-06-04 17:21:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 17:21:14,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-04 17:21:14,947 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 3452 flow. Second operand 9 states and 109 transitions. [2024-06-04 17:21:14,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 3954 flow [2024-06-04 17:21:15,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 270 transitions, 3796 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:15,123 INFO L231 Difference]: Finished difference. Result has 255 places, 260 transitions, 3357 flow [2024-06-04 17:21:15,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3294, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3357, PETRI_PLACES=255, PETRI_TRANSITIONS=260} [2024-06-04 17:21:15,125 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 222 predicate places. [2024-06-04 17:21:15,125 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 260 transitions, 3357 flow [2024-06-04 17:21:15,140 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 17:21:15,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:15,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:15,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 17:21:15,141 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 17:21:15,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1810153744, now seen corresponding path program 10 times [2024-06-04 17:21:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761866888] [2024-06-04 17:21:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:22,938 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 17:21:22,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:22,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761866888] [2024-06-04 17:21:22,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761866888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:22,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:22,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013119255] [2024-06-04 17:21:22,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:22,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:22,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:22,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:22,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:23,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:21:23,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 260 transitions, 3357 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 17:21:23,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:23,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:21:23,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:23,684 INFO L124 PetriNetUnfolderBase]: 663/1143 cut-off events. [2024-06-04 17:21:23,684 INFO L125 PetriNetUnfolderBase]: For 84906/84906 co-relation queries the response was YES. [2024-06-04 17:21:23,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9371 conditions, 1143 events. 663/1143 cut-off events. For 84906/84906 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 5375 event pairs, 183 based on Foata normal form. 3/1146 useless extension candidates. Maximal degree in co-relation 9267. Up to 1015 conditions per place. [2024-06-04 17:21:23,693 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 250 selfloop transitions, 32 changer transitions 0/284 dead transitions. [2024-06-04 17:21:23,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 284 transitions, 4285 flow [2024-06-04 17:21:23,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:23,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:21:23,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:21:23,694 INFO L175 Difference]: Start difference. First operand has 255 places, 260 transitions, 3357 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:21:23,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 284 transitions, 4285 flow [2024-06-04 17:21:23,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 284 transitions, 4235 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:23,886 INFO L231 Difference]: Finished difference. Result has 257 places, 266 transitions, 3460 flow [2024-06-04 17:21:23,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3307, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3460, PETRI_PLACES=257, PETRI_TRANSITIONS=266} [2024-06-04 17:21:23,887 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 224 predicate places. [2024-06-04 17:21:23,887 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 266 transitions, 3460 flow [2024-06-04 17:21:23,887 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 17:21:23,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:23,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:23,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 17:21:23,888 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 17:21:23,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:23,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1594056664, now seen corresponding path program 11 times [2024-06-04 17:21:23,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:23,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926201443] [2024-06-04 17:21:23,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:23,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:31,678 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 17:21:31,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:31,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926201443] [2024-06-04 17:21:31,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926201443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:31,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298808851] [2024-06-04 17:21:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:31,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:31,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:31,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:31,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:31,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:21:31,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 266 transitions, 3460 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 17:21:31,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:31,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:21:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:32,390 INFO L124 PetriNetUnfolderBase]: 672/1158 cut-off events. [2024-06-04 17:21:32,390 INFO L125 PetriNetUnfolderBase]: For 88482/88482 co-relation queries the response was YES. [2024-06-04 17:21:32,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 1158 events. 672/1158 cut-off events. For 88482/88482 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5459 event pairs, 184 based on Foata normal form. 3/1161 useless extension candidates. Maximal degree in co-relation 9441. Up to 1111 conditions per place. [2024-06-04 17:21:32,401 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 262 selfloop transitions, 17 changer transitions 0/281 dead transitions. [2024-06-04 17:21:32,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 281 transitions, 4104 flow [2024-06-04 17:21:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2024-06-04 17:21:32,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3366013071895425 [2024-06-04 17:21:32,403 INFO L175 Difference]: Start difference. First operand has 257 places, 266 transitions, 3460 flow. Second operand 9 states and 103 transitions. [2024-06-04 17:21:32,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 281 transitions, 4104 flow [2024-06-04 17:21:32,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 281 transitions, 4039 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 17:21:32,585 INFO L231 Difference]: Finished difference. Result has 261 places, 269 transitions, 3489 flow [2024-06-04 17:21:32,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3489, PETRI_PLACES=261, PETRI_TRANSITIONS=269} [2024-06-04 17:21:32,586 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 228 predicate places. [2024-06-04 17:21:32,586 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 269 transitions, 3489 flow [2024-06-04 17:21:32,586 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 17:21:32,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:32,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 17:21:32,587 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 17:21:32,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1583928964, now seen corresponding path program 12 times [2024-06-04 17:21:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416248940] [2024-06-04 17:21:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:40,933 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 17:21:40,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:40,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416248940] [2024-06-04 17:21:40,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416248940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:40,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:40,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553350876] [2024-06-04 17:21:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:41,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:21:41,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 269 transitions, 3489 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 17:21:41,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:41,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:21:41,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:41,648 INFO L124 PetriNetUnfolderBase]: 681/1173 cut-off events. [2024-06-04 17:21:41,648 INFO L125 PetriNetUnfolderBase]: For 91690/91690 co-relation queries the response was YES. [2024-06-04 17:21:41,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9643 conditions, 1173 events. 681/1173 cut-off events. For 91690/91690 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5549 event pairs, 182 based on Foata normal form. 3/1176 useless extension candidates. Maximal degree in co-relation 9537. Up to 1084 conditions per place. [2024-06-04 17:21:41,658 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 257 selfloop transitions, 28 changer transitions 0/287 dead transitions. [2024-06-04 17:21:41,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 287 transitions, 4270 flow [2024-06-04 17:21:41,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 17:21:41,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-04 17:21:41,659 INFO L175 Difference]: Start difference. First operand has 261 places, 269 transitions, 3489 flow. Second operand 9 states and 109 transitions. [2024-06-04 17:21:41,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 287 transitions, 4270 flow [2024-06-04 17:21:41,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 287 transitions, 4225 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:41,865 INFO L231 Difference]: Finished difference. Result has 263 places, 272 transitions, 3556 flow [2024-06-04 17:21:41,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3444, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3556, PETRI_PLACES=263, PETRI_TRANSITIONS=272} [2024-06-04 17:21:41,866 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 230 predicate places. [2024-06-04 17:21:41,866 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 272 transitions, 3556 flow [2024-06-04 17:21:41,866 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 17:21:41,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:41,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:41,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 17:21:41,866 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 17:21:41,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:41,867 INFO L85 PathProgramCache]: Analyzing trace with hash -242525216, now seen corresponding path program 14 times [2024-06-04 17:21:41,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:41,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902615469] [2024-06-04 17:21:41,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:50,260 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 17:21:50,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:50,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902615469] [2024-06-04 17:21:50,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902615469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:50,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:50,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:50,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374842654] [2024-06-04 17:21:50,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:50,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:50,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:50,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:50,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:50,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:21:50,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 272 transitions, 3556 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 17:21:50,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:50,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:21:50,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:21:50,957 INFO L124 PetriNetUnfolderBase]: 651/1142 cut-off events. [2024-06-04 17:21:50,958 INFO L125 PetriNetUnfolderBase]: For 90728/90728 co-relation queries the response was YES. [2024-06-04 17:21:50,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9496 conditions, 1142 events. 651/1142 cut-off events. For 90728/90728 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5510 event pairs, 172 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 9389. Up to 1034 conditions per place. [2024-06-04 17:21:50,969 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 230 selfloop transitions, 15 changer transitions 0/280 dead transitions. [2024-06-04 17:21:50,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 280 transitions, 4064 flow [2024-06-04 17:21:50,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:21:50,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:21:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:21:50,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-04 17:21:50,971 INFO L175 Difference]: Start difference. First operand has 263 places, 272 transitions, 3556 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:21:50,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 280 transitions, 4064 flow [2024-06-04 17:21:51,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 280 transitions, 3963 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 17:21:51,229 INFO L231 Difference]: Finished difference. Result has 265 places, 272 transitions, 3490 flow [2024-06-04 17:21:51,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3455, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3490, PETRI_PLACES=265, PETRI_TRANSITIONS=272} [2024-06-04 17:21:51,230 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 232 predicate places. [2024-06-04 17:21:51,230 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 272 transitions, 3490 flow [2024-06-04 17:21:51,230 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 17:21:51,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:21:51,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:21:51,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 17:21:51,231 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 17:21:51,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:21:51,231 INFO L85 PathProgramCache]: Analyzing trace with hash 42811990, now seen corresponding path program 17 times [2024-06-04 17:21:51,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:21:51,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769213555] [2024-06-04 17:21:51,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:21:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:21:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:21:59,651 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 17:21:59,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:21:59,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769213555] [2024-06-04 17:21:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769213555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:21:59,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:21:59,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:21:59,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377718258] [2024-06-04 17:21:59,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:21:59,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:21:59,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:21:59,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:21:59,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:21:59,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:21:59,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 272 transitions, 3490 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 17:21:59,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:21:59,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:21:59,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:00,322 INFO L124 PetriNetUnfolderBase]: 682/1175 cut-off events. [2024-06-04 17:22:00,322 INFO L125 PetriNetUnfolderBase]: For 92585/92585 co-relation queries the response was YES. [2024-06-04 17:22:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9640 conditions, 1175 events. 682/1175 cut-off events. For 92585/92585 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5576 event pairs, 187 based on Foata normal form. 1/1176 useless extension candidates. Maximal degree in co-relation 9532. Up to 1144 conditions per place. [2024-06-04 17:22:00,365 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 265 selfloop transitions, 15 changer transitions 0/282 dead transitions. [2024-06-04 17:22:00,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 282 transitions, 4095 flow [2024-06-04 17:22:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2024-06-04 17:22:00,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3235294117647059 [2024-06-04 17:22:00,366 INFO L175 Difference]: Start difference. First operand has 265 places, 272 transitions, 3490 flow. Second operand 9 states and 99 transitions. [2024-06-04 17:22:00,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 282 transitions, 4095 flow [2024-06-04 17:22:00,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 282 transitions, 3952 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-04 17:22:00,593 INFO L231 Difference]: Finished difference. Result has 264 places, 274 transitions, 3413 flow [2024-06-04 17:22:00,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3347, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3413, PETRI_PLACES=264, PETRI_TRANSITIONS=274} [2024-06-04 17:22:00,594 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 231 predicate places. [2024-06-04 17:22:00,594 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 274 transitions, 3413 flow [2024-06-04 17:22:00,594 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 17:22:00,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:00,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:00,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 17:22:00,595 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 17:22:00,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:00,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1298829094, now seen corresponding path program 13 times [2024-06-04 17:22:00,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:00,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031713030] [2024-06-04 17:22:00,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:00,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:09,195 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 17:22:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:09,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031713030] [2024-06-04 17:22:09,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031713030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:09,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:09,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231997950] [2024-06-04 17:22:09,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:09,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:09,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:22:09,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 274 transitions, 3413 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 17:22:09,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:09,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:22:09,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:09,841 INFO L124 PetriNetUnfolderBase]: 691/1190 cut-off events. [2024-06-04 17:22:09,841 INFO L125 PetriNetUnfolderBase]: For 98443/98443 co-relation queries the response was YES. [2024-06-04 17:22:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9724 conditions, 1190 events. 691/1190 cut-off events. For 98443/98443 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 5644 event pairs, 185 based on Foata normal form. 3/1193 useless extension candidates. Maximal degree in co-relation 9615. Up to 1041 conditions per place. [2024-06-04 17:22:09,853 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 255 selfloop transitions, 40 changer transitions 0/297 dead transitions. [2024-06-04 17:22:09,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 297 transitions, 4351 flow [2024-06-04 17:22:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-04 17:22:09,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38235294117647056 [2024-06-04 17:22:09,854 INFO L175 Difference]: Start difference. First operand has 264 places, 274 transitions, 3413 flow. Second operand 9 states and 117 transitions. [2024-06-04 17:22:09,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 297 transitions, 4351 flow [2024-06-04 17:22:10,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 297 transitions, 4316 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:10,081 INFO L231 Difference]: Finished difference. Result has 266 places, 277 transitions, 3500 flow [2024-06-04 17:22:10,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3378, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3500, PETRI_PLACES=266, PETRI_TRANSITIONS=277} [2024-06-04 17:22:10,081 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 233 predicate places. [2024-06-04 17:22:10,082 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 277 transitions, 3500 flow [2024-06-04 17:22:10,082 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 17:22:10,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:10,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 17:22:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 17:22:10,082 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 17:22:10,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -242518520, now seen corresponding path program 18 times [2024-06-04 17:22:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909345508] [2024-06-04 17:22:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:18,412 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 17:22:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:18,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909345508] [2024-06-04 17:22:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909345508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310366038] [2024-06-04 17:22:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:18,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:18,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:18,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:18,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:18,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:22:18,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 277 transitions, 3500 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 17:22:18,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:18,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:22:18,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:19,064 INFO L124 PetriNetUnfolderBase]: 699/1203 cut-off events. [2024-06-04 17:22:19,064 INFO L125 PetriNetUnfolderBase]: For 100411/100411 co-relation queries the response was YES. [2024-06-04 17:22:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 1203 events. 699/1203 cut-off events. For 100411/100411 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5743 event pairs, 187 based on Foata normal form. 1/1204 useless extension candidates. Maximal degree in co-relation 9877. Up to 1143 conditions per place. [2024-06-04 17:22:19,075 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 261 selfloop transitions, 28 changer transitions 0/291 dead transitions. [2024-06-04 17:22:19,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 291 transitions, 4398 flow [2024-06-04 17:22:19,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-04 17:22:19,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3464052287581699 [2024-06-04 17:22:19,078 INFO L175 Difference]: Start difference. First operand has 266 places, 277 transitions, 3500 flow. Second operand 9 states and 106 transitions. [2024-06-04 17:22:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 291 transitions, 4398 flow [2024-06-04 17:22:19,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 291 transitions, 4324 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 17:22:19,270 INFO L231 Difference]: Finished difference. Result has 269 places, 281 transitions, 3549 flow [2024-06-04 17:22:19,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3549, PETRI_PLACES=269, PETRI_TRANSITIONS=281} [2024-06-04 17:22:19,271 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 236 predicate places. [2024-06-04 17:22:19,271 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 281 transitions, 3549 flow [2024-06-04 17:22:19,271 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 17:22:19,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:19,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:19,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 17:22:19,271 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 17:22:19,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:19,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1583937334, now seen corresponding path program 14 times [2024-06-04 17:22:19,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:19,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406183471] [2024-06-04 17:22:19,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:19,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:27,579 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 17:22:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406183471] [2024-06-04 17:22:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406183471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:27,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088553001] [2024-06-04 17:22:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:27,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:27,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:27,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:22:27,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 281 transitions, 3549 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 17:22:27,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:27,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:22:27,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:28,319 INFO L124 PetriNetUnfolderBase]: 693/1194 cut-off events. [2024-06-04 17:22:28,320 INFO L125 PetriNetUnfolderBase]: For 101816/101816 co-relation queries the response was YES. [2024-06-04 17:22:28,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9773 conditions, 1194 events. 693/1194 cut-off events. For 101816/101816 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5693 event pairs, 182 based on Foata normal form. 3/1197 useless extension candidates. Maximal degree in co-relation 9662. Up to 1110 conditions per place. [2024-06-04 17:22:28,331 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 269 selfloop transitions, 26 changer transitions 0/297 dead transitions. [2024-06-04 17:22:28,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 297 transitions, 4205 flow [2024-06-04 17:22:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 17:22:28,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3562091503267974 [2024-06-04 17:22:28,332 INFO L175 Difference]: Start difference. First operand has 269 places, 281 transitions, 3549 flow. Second operand 9 states and 109 transitions. [2024-06-04 17:22:28,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 297 transitions, 4205 flow [2024-06-04 17:22:28,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 297 transitions, 4058 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 17:22:28,572 INFO L231 Difference]: Finished difference. Result has 271 places, 281 transitions, 3461 flow [2024-06-04 17:22:28,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3461, PETRI_PLACES=271, PETRI_TRANSITIONS=281} [2024-06-04 17:22:28,572 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 238 predicate places. [2024-06-04 17:22:28,572 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 281 transitions, 3461 flow [2024-06-04 17:22:28,572 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 17:22:28,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:28,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:28,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 17:22:28,573 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 17:22:28,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash -242518272, now seen corresponding path program 15 times [2024-06-04 17:22:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153259442] [2024-06-04 17:22:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:36,939 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 17:22:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153259442] [2024-06-04 17:22:36,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153259442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:36,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:36,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814790497] [2024-06-04 17:22:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:36,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:36,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:37,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:22:37,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 281 transitions, 3461 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 17:22:37,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:37,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:22:37,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:37,779 INFO L124 PetriNetUnfolderBase]: 687/1185 cut-off events. [2024-06-04 17:22:37,780 INFO L125 PetriNetUnfolderBase]: For 98728/98728 co-relation queries the response was YES. [2024-06-04 17:22:37,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9554 conditions, 1185 events. 687/1185 cut-off events. For 98728/98728 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 178 based on Foata normal form. 3/1188 useless extension candidates. Maximal degree in co-relation 9442. Up to 1046 conditions per place. [2024-06-04 17:22:37,789 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 248 selfloop transitions, 45 changer transitions 0/295 dead transitions. [2024-06-04 17:22:37,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 295 transitions, 4096 flow [2024-06-04 17:22:37,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-04 17:22:37,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3627450980392157 [2024-06-04 17:22:37,790 INFO L175 Difference]: Start difference. First operand has 271 places, 281 transitions, 3461 flow. Second operand 9 states and 111 transitions. [2024-06-04 17:22:37,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 295 transitions, 4096 flow [2024-06-04 17:22:38,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 295 transitions, 4018 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-04 17:22:38,014 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3479 flow [2024-06-04 17:22:38,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3383, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3479, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-04 17:22:38,014 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-04 17:22:38,014 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3479 flow [2024-06-04 17:22:38,015 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 17:22:38,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:38,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:38,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 17:22:38,015 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 17:22:38,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:38,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1809907976, now seen corresponding path program 19 times [2024-06-04 17:22:38,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:38,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401373109] [2024-06-04 17:22:38,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:38,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:45,880 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 17:22:45,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:45,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401373109] [2024-06-04 17:22:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401373109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099101574] [2024-06-04 17:22:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:45,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:45,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:45,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:45,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:46,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:46,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3479 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 17:22:46,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:46,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:46,433 INFO L124 PetriNetUnfolderBase]: 685/1182 cut-off events. [2024-06-04 17:22:46,433 INFO L125 PetriNetUnfolderBase]: For 96082/96082 co-relation queries the response was YES. [2024-06-04 17:22:46,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9552 conditions, 1182 events. 685/1182 cut-off events. For 96082/96082 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5632 event pairs, 184 based on Foata normal form. 1/1183 useless extension candidates. Maximal degree in co-relation 9439. Up to 1123 conditions per place. [2024-06-04 17:22:46,444 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 258 selfloop transitions, 30 changer transitions 0/290 dead transitions. [2024-06-04 17:22:46,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 290 transitions, 4199 flow [2024-06-04 17:22:46,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-04 17:22:46,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369281045751634 [2024-06-04 17:22:46,445 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3479 flow. Second operand 9 states and 113 transitions. [2024-06-04 17:22:46,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 290 transitions, 4199 flow [2024-06-04 17:22:46,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 290 transitions, 4085 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:22:46,695 INFO L231 Difference]: Finished difference. Result has 272 places, 281 transitions, 3430 flow [2024-06-04 17:22:46,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3365, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3430, PETRI_PLACES=272, PETRI_TRANSITIONS=281} [2024-06-04 17:22:46,695 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2024-06-04 17:22:46,695 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 281 transitions, 3430 flow [2024-06-04 17:22:46,696 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 17:22:46,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:46,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:46,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 17:22:46,696 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 17:22:46,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:46,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1810145126, now seen corresponding path program 20 times [2024-06-04 17:22:46,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:46,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637844981] [2024-06-04 17:22:46,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:46,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:22:53,888 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 17:22:53,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:22:53,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637844981] [2024-06-04 17:22:53,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637844981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:22:53,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:22:53,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:22:53,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428096145] [2024-06-04 17:22:53,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:22:53,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:22:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:22:53,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:22:53,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:22:54,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:22:54,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 281 transitions, 3430 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 17:22:54,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:22:54,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:22:54,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:22:54,451 INFO L124 PetriNetUnfolderBase]: 683/1179 cut-off events. [2024-06-04 17:22:54,451 INFO L125 PetriNetUnfolderBase]: For 96693/96693 co-relation queries the response was YES. [2024-06-04 17:22:54,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 1179 events. 683/1179 cut-off events. For 96693/96693 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5628 event pairs, 184 based on Foata normal form. 1/1180 useless extension candidates. Maximal degree in co-relation 9351. Up to 1121 conditions per place. [2024-06-04 17:22:54,464 INFO L140 encePairwiseOnDemand]: 24/34 looper letters, 260 selfloop transitions, 27 changer transitions 0/289 dead transitions. [2024-06-04 17:22:54,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 289 transitions, 4022 flow [2024-06-04 17:22:54,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:22:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:22:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-04 17:22:54,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37254901960784315 [2024-06-04 17:22:54,465 INFO L175 Difference]: Start difference. First operand has 272 places, 281 transitions, 3430 flow. Second operand 9 states and 114 transitions. [2024-06-04 17:22:54,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 289 transitions, 4022 flow [2024-06-04 17:22:54,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 289 transitions, 3903 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-04 17:22:54,681 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3370 flow [2024-06-04 17:22:54,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3311, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3370, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-04 17:22:54,681 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-04 17:22:54,681 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3370 flow [2024-06-04 17:22:54,681 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 17:22:54,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:22:54,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:22:54,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 17:22:54,682 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 17:22:54,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:22:54,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1594426060, now seen corresponding path program 1 times [2024-06-04 17:22:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:22:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381058547] [2024-06-04 17:22:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:22:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:22:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:05,067 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 17:23:05,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:05,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381058547] [2024-06-04 17:23:05,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381058547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:05,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:23:05,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792104160] [2024-06-04 17:23:05,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:05,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:23:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:23:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:23:05,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:05,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3370 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 17:23:05,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:05,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:05,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:05,914 INFO L124 PetriNetUnfolderBase]: 630/1120 cut-off events. [2024-06-04 17:23:05,914 INFO L125 PetriNetUnfolderBase]: For 99040/99045 co-relation queries the response was YES. [2024-06-04 17:23:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8928 conditions, 1120 events. 630/1120 cut-off events. For 99040/99045 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5518 event pairs, 167 based on Foata normal form. 7/1121 useless extension candidates. Maximal degree in co-relation 8813. Up to 969 conditions per place. [2024-06-04 17:23:05,927 INFO L140 encePairwiseOnDemand]: 25/34 looper letters, 225 selfloop transitions, 14 changer transitions 0/291 dead transitions. [2024-06-04 17:23:05,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 291 transitions, 3870 flow [2024-06-04 17:23:05,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 17:23:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 17:23:05,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 17:23:05,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2024-06-04 17:23:05,929 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3370 flow. Second operand 9 states and 107 transitions. [2024-06-04 17:23:05,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 291 transitions, 3870 flow [2024-06-04 17:23:06,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 291 transitions, 3789 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 17:23:06,151 INFO L231 Difference]: Finished difference. Result has 273 places, 281 transitions, 3321 flow [2024-06-04 17:23:06,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3289, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3321, PETRI_PLACES=273, PETRI_TRANSITIONS=281} [2024-06-04 17:23:06,152 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2024-06-04 17:23:06,152 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 281 transitions, 3321 flow [2024-06-04 17:23:06,156 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 17:23:06,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:06,156 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 17:23:06,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 17:23:06,156 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 17:23:06,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -668943389, now seen corresponding path program 1 times [2024-06-04 17:23:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312896574] [2024-06-04 17:23:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:16,459 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 17:23:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:16,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312896574] [2024-06-04 17:23:16,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312896574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:16,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:16,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 17:23:16,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902832045] [2024-06-04 17:23:16,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:16,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 17:23:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 17:23:16,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 17:23:16,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:16,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 281 transitions, 3321 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 17:23:16,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:16,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:16,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:17,284 INFO L124 PetriNetUnfolderBase]: 665/1167 cut-off events. [2024-06-04 17:23:17,285 INFO L125 PetriNetUnfolderBase]: For 108924/108926 co-relation queries the response was YES. [2024-06-04 17:23:17,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9479 conditions, 1167 events. 665/1167 cut-off events. For 108924/108926 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5719 event pairs, 109 based on Foata normal form. 1/1166 useless extension candidates. Maximal degree in co-relation 9363. Up to 942 conditions per place. [2024-06-04 17:23:17,296 INFO L140 encePairwiseOnDemand]: 23/34 looper letters, 225 selfloop transitions, 45 changer transitions 0/308 dead transitions. [2024-06-04 17:23:17,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 308 transitions, 4109 flow [2024-06-04 17:23:17,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:17,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-04 17:23:17,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877005347593583 [2024-06-04 17:23:17,298 INFO L175 Difference]: Start difference. First operand has 273 places, 281 transitions, 3321 flow. Second operand 11 states and 145 transitions. [2024-06-04 17:23:17,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 308 transitions, 4109 flow [2024-06-04 17:23:17,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 308 transitions, 4075 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 17:23:17,515 INFO L231 Difference]: Finished difference. Result has 278 places, 288 transitions, 3468 flow [2024-06-04 17:23:17,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3287, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3468, PETRI_PLACES=278, PETRI_TRANSITIONS=288} [2024-06-04 17:23:17,515 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 245 predicate places. [2024-06-04 17:23:17,515 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 288 transitions, 3468 flow [2024-06-04 17:23:17,515 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 17:23:17,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:17,516 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 17:23:17,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 17:23:17,517 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 17:23:17,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:17,517 INFO L85 PathProgramCache]: Analyzing trace with hash -274100732, now seen corresponding path program 1 times [2024-06-04 17:23:17,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:17,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986524722] [2024-06-04 17:23:17,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:17,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:27,722 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 17:23:27,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986524722] [2024-06-04 17:23:27,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986524722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:27,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:27,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:23:27,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195703805] [2024-06-04 17:23:27,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:27,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:23:27,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:23:27,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:23:27,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:23:27,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 288 transitions, 3468 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 17:23:27,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:27,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:23:27,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:28,487 INFO L124 PetriNetUnfolderBase]: 700/1207 cut-off events. [2024-06-04 17:23:28,487 INFO L125 PetriNetUnfolderBase]: For 105326/105326 co-relation queries the response was YES. [2024-06-04 17:23:28,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9802 conditions, 1207 events. 700/1207 cut-off events. For 105326/105326 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5813 event pairs, 121 based on Foata normal form. 1/1208 useless extension candidates. Maximal degree in co-relation 9684. Up to 1089 conditions per place. [2024-06-04 17:23:28,500 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 265 selfloop transitions, 46 changer transitions 0/313 dead transitions. [2024-06-04 17:23:28,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 313 transitions, 4324 flow [2024-06-04 17:23:28,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-04 17:23:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-04 17:23:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 141 transitions. [2024-06-04 17:23:28,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34558823529411764 [2024-06-04 17:23:28,502 INFO L175 Difference]: Start difference. First operand has 278 places, 288 transitions, 3468 flow. Second operand 12 states and 141 transitions. [2024-06-04 17:23:28,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 313 transitions, 4324 flow [2024-06-04 17:23:28,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 313 transitions, 4231 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 17:23:28,810 INFO L231 Difference]: Finished difference. Result has 284 places, 292 transitions, 3524 flow [2024-06-04 17:23:28,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3524, PETRI_PLACES=284, PETRI_TRANSITIONS=292} [2024-06-04 17:23:28,810 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 251 predicate places. [2024-06-04 17:23:28,810 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 292 transitions, 3524 flow [2024-06-04 17:23:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 17:23:28,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:28,811 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 17:23:28,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 17:23:28,811 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 17:23:28,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 705032961, now seen corresponding path program 2 times [2024-06-04 17:23:28,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:28,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687733352] [2024-06-04 17:23:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:40,132 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 17:23:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687733352] [2024-06-04 17:23:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687733352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:40,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:23:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941676452] [2024-06-04 17:23:40,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:40,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:23:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:40,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:23:40,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:23:40,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2024-06-04 17:23:40,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 292 transitions, 3524 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 17:23:40,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:40,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2024-06-04 17:23:40,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:23:40,988 INFO L124 PetriNetUnfolderBase]: 688/1205 cut-off events. [2024-06-04 17:23:40,989 INFO L125 PetriNetUnfolderBase]: For 115903/115905 co-relation queries the response was YES. [2024-06-04 17:23:40,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9931 conditions, 1205 events. 688/1205 cut-off events. For 115903/115905 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5965 event pairs, 112 based on Foata normal form. 1/1202 useless extension candidates. Maximal degree in co-relation 9812. Up to 1001 conditions per place. [2024-06-04 17:23:41,000 INFO L140 encePairwiseOnDemand]: 22/34 looper letters, 231 selfloop transitions, 47 changer transitions 0/318 dead transitions. [2024-06-04 17:23:41,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 318 transitions, 4197 flow [2024-06-04 17:23:41,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 17:23:41,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 17:23:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 141 transitions. [2024-06-04 17:23:41,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3770053475935829 [2024-06-04 17:23:41,010 INFO L175 Difference]: Start difference. First operand has 284 places, 292 transitions, 3524 flow. Second operand 11 states and 141 transitions. [2024-06-04 17:23:41,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 318 transitions, 4197 flow [2024-06-04 17:23:41,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 318 transitions, 4092 flow, removed 17 selfloop flow, removed 10 redundant places. [2024-06-04 17:23:41,318 INFO L231 Difference]: Finished difference. Result has 286 places, 300 transitions, 3614 flow [2024-06-04 17:23:41,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=3419, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3614, PETRI_PLACES=286, PETRI_TRANSITIONS=300} [2024-06-04 17:23:41,319 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 253 predicate places. [2024-06-04 17:23:41,319 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 300 transitions, 3614 flow [2024-06-04 17:23:41,320 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 17:23:41,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:23:41,320 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 17:23:41,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 17:23:41,320 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 17:23:41,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:23:41,320 INFO L85 PathProgramCache]: Analyzing trace with hash 710244104, now seen corresponding path program 2 times [2024-06-04 17:23:41,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:23:41,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520103924] [2024-06-04 17:23:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:23:41,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:23:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:23:51,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 17:23:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:23:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520103924] [2024-06-04 17:23:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520103924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:23:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:23:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 17:23:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212829504] [2024-06-04 17:23:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:23:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 17:23:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:23:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 17:23:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-04 17:23:51,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 34 [2024-06-04 17:23:51,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 300 transitions, 3614 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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 17:23:51,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:23:51,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 34 [2024-06-04 17:23:51,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15