./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix031.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-76401ed-m [2024-06-20 18:56:49,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:56:49,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:56:49,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:56:49,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:56:50,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:56:50,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:56:50,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:56:50,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:56:50,008 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:56:50,008 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:56:50,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:56:50,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:56:50,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:56:50,011 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:56:50,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:56:50,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:56:50,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:56:50,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:56:50,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:56:50,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:56:50,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:56:50,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:56:50,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:56:50,013 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:56:50,013 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:56:50,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:56:50,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:56:50,014 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:56:50,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:56:50,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:56:50,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:56:50,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:56:50,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:56:50,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:56:50,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:56:50,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:56:50,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:56:50,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:56:50,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:56:50,018 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:56:50,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:56:50,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:56:50,018 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-20 18:56:50,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:56:50,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:56:50,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:56:50,301 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:56:50,301 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:56:50,302 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.opt.yml/witness.yml [2024-06-20 18:56:50,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:56:50,422 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:56:50,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-06-20 18:56:51,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:56:51,708 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:56:51,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031.opt.i [2024-06-20 18:56:51,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7d4c599/5416fc3de5324875a366852c0da0e519/FLAG089634ec5 [2024-06-20 18:56:51,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c7d4c599/5416fc3de5324875a366852c0da0e519 [2024-06-20 18:56:51,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:56:51,737 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:56:51,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:56:51,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:56:51,745 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:56:51,746 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:56:50" (1/2) ... [2024-06-20 18:56:51,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eff41bc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:56:51, skipping insertion in model container [2024-06-20 18:56:51,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:56:50" (1/2) ... [2024-06-20 18:56:51,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@bfc687d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:56:51, skipping insertion in model container [2024-06-20 18:56:51,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:56:51" (2/2) ... [2024-06-20 18:56:51,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eff41bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:51, skipping insertion in model container [2024-06-20 18:56:51,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:56:51" (2/2) ... [2024-06-20 18:56:51,749 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:56:51,804 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:56:51,806 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-20 18:56:51,806 INFO L97 edCorrectnessWitness]: Location invariant before [L827-L827] (((((((((((((((((((! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1))) && (! multithreaded || ((0 <= __unbuffered_p0_EBX && __unbuffered_p0_EBX <= 1) && (__unbuffered_p0_EBX == 0 || __unbuffered_p0_EBX == 1)))) && (! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )a >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )z >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )z >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p0_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )x) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )z >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EBX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 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 )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 )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 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 )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )y$flush_delayed >= 0LL) && (long long )a + (long long )y$mem_tmp >= 0LL) && (long long )a + (long long )y$r_buff0_thd0 >= 0LL) && (long long )a + (long long )y$r_buff0_thd1 >= 0LL) && (long long )a + (long long )y$r_buff0_thd2 >= 0LL) && (long long )a + (long long )y$r_buff1_thd0 >= 0LL) && (long long )a + (long long )y$r_buff1_thd1 >= 0LL) && (long long )a + (long long )y$r_buff1_thd2 >= 0LL) && (long long )a + (long long )y$read_delayed >= 0LL) && (long long )a + (long long )y$w_buff0 >= 0LL) && (long long )a + (long long )y$w_buff1 >= 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 )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 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 )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )z >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )z >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )z >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )z >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )z >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )z >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )z >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )z >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )z >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )z >= 0LL) && (long long )y$w_buff1 + (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 )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 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 )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p0_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )a) - (long long )x >= 0LL) && (1LL + (long long )a) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )a >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a) - (long long )x >= 0LL) && (2LL - (long long )a) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EBX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )a - (long long )y$r_buff0_thd0 >= 0LL) && (long long )a - (long long )y$r_buff0_thd1 >= 0LL) && (long long )a - (long long )y$r_buff1_thd0 >= 0LL) && (long long )a - (long long )y$r_buff1_thd1 >= 0LL) && (long long )a - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p0_EBX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && 0 <= z) && __unbuffered_p0_EAX <= 1) && __unbuffered_p0_EBX <= 1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && a <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && z <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$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)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)) && (z == 0 || z == 1)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) [2024-06-20 18:56:51,807 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:56:51,807 INFO L106 edCorrectnessWitness]: ghost_update [L824-L824] multithreaded = 1; [2024-06-20 18:56:51,846 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:56:52,203 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:56:52,211 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:56:52,477 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:56:52,527 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:56:52,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52 WrapperNode [2024-06-20 18:56:52,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:56:52,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:56:52,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:56:52,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:56:52,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,651 INFO L138 Inliner]: procedures = 174, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 123 [2024-06-20 18:56:52,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:56:52,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:56:52,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:56:52,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:56:52,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,717 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,757 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-20 18:56:52,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:56:52,861 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:56:52,861 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:56:52,861 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:56:52,862 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (1/1) ... [2024-06-20 18:56:52,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:56:52,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:56:52,905 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-20 18:56:52,914 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-20 18:56:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:56:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:56:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:56:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:56:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:56:52,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:56:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:56:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:56:52,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:56:52,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:56:52,940 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:56:53,066 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:56:53,068 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:56:54,055 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:56:54,055 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:56:54,257 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:56:54,257 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:56:54,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:56:54 BoogieIcfgContainer [2024-06-20 18:56:54,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:56:54,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:56:54,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:56:54,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:56:54,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:56:50" (1/4) ... [2024-06-20 18:56:54,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb08691 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:56:54, skipping insertion in model container [2024-06-20 18:56:54,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:56:51" (2/4) ... [2024-06-20 18:56:54,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb08691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:56:54, skipping insertion in model container [2024-06-20 18:56:54,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:56:52" (3/4) ... [2024-06-20 18:56:54,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb08691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:56:54, skipping insertion in model container [2024-06-20 18:56:54,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:56:54" (4/4) ... [2024-06-20 18:56:54,269 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031.opt.i [2024-06-20 18:56:54,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:56:54,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 18:56:54,284 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:56:54,380 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:56:54,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-20 18:56:54,467 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-20 18:56:54,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:56:54,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:56:54,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-20 18:56:54,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-20 18:56:54,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:56:54,484 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;@66bbc517, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:56:54,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 18:56:54,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:56:54,492 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 18:56:54,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:56:54,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:56:54,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:56:54,493 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-20 18:56:54,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:56:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 332713848, now seen corresponding path program 1 times [2024-06-20 18:56:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:56:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968534625] [2024-06-20 18:56:54,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:56:54,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:56:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:00,994 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-20 18:57:00,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:00,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968534625] [2024-06-20 18:57:00,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968534625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:00,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:00,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:57:00,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909384440] [2024-06-20 18:57:00,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:01,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:57:01,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:57:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:57:01,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2024-06-20 18:57:01,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:01,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:01,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2024-06-20 18:57:01,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:01,354 INFO L124 PetriNetUnfolderBase]: 162/326 cut-off events. [2024-06-20 18:57:01,355 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 18:57:01,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 326 events. 162/326 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1351 event pairs, 97 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 626. Up to 288 conditions per place. [2024-06-20 18:57:01,359 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 21 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-20 18:57:01,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 119 flow [2024-06-20 18:57:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:57:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:57:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-06-20 18:57:01,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6262626262626263 [2024-06-20 18:57:01,369 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 62 transitions. [2024-06-20 18:57:01,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 119 flow [2024-06-20 18:57:01,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 18:57:01,372 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-20 18:57:01,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-20 18:57:01,376 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-20 18:57:01,376 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-20 18:57:01,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:01,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:01,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:01,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:57:01,377 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-20 18:57:01,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1910456599, now seen corresponding path program 1 times [2024-06-20 18:57:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323704503] [2024-06-20 18:57:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:06,448 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-20 18:57:06,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:06,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323704503] [2024-06-20 18:57:06,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323704503] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:06,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:57:06,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212750197] [2024-06-20 18:57:06,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:06,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:57:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:57:06,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:57:06,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 33 [2024-06-20 18:57:06,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:06,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:06,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 33 [2024-06-20 18:57:06,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:06,851 INFO L124 PetriNetUnfolderBase]: 186/356 cut-off events. [2024-06-20 18:57:06,852 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-06-20 18:57:06,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 798 conditions, 356 events. 186/356 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1455 event pairs, 94 based on Foata normal form. 2/351 useless extension candidates. Maximal degree in co-relation 786. Up to 319 conditions per place. [2024-06-20 18:57:06,857 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 26 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-20 18:57:06,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 163 flow [2024-06-20 18:57:06,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:57:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:57:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-20 18:57:06,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-20 18:57:06,862 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 77 transitions. [2024-06-20 18:57:06,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 163 flow [2024-06-20 18:57:06,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 160 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:57:06,866 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-20 18:57:06,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-20 18:57:06,867 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-20 18:57:06,867 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-20 18:57:06,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:06,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:06,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:06,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:57:06,869 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-20 18:57:06,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash -905386621, now seen corresponding path program 1 times [2024-06-20 18:57:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:06,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847196760] [2024-06-20 18:57:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:06,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:57:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847196760] [2024-06-20 18:57:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847196760] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:57:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203560523] [2024-06-20 18:57:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:11,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:57:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:57:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:57:11,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-20 18:57:11,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-20 18:57:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:12,022 INFO L124 PetriNetUnfolderBase]: 219/412 cut-off events. [2024-06-20 18:57:12,022 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-06-20 18:57:12,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 412 events. 219/412 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1622 event pairs, 99 based on Foata normal form. 2/409 useless extension candidates. Maximal degree in co-relation 1004. Up to 366 conditions per place. [2024-06-20 18:57:12,025 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 31 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-20 18:57:12,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 213 flow [2024-06-20 18:57:12,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:57:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:57:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-20 18:57:12,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-06-20 18:57:12,027 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 90 transitions. [2024-06-20 18:57:12,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 213 flow [2024-06-20 18:57:12,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 204 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 18:57:12,028 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-20 18:57:12,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-20 18:57:12,029 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-20 18:57:12,029 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-20 18:57:12,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:12,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:12,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:12,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:57:12,030 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-20 18:57:12,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:12,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1937007300, now seen corresponding path program 1 times [2024-06-20 18:57:12,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:12,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068139107] [2024-06-20 18:57:12,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:12,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:16,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:57:16,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:16,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068139107] [2024-06-20 18:57:16,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068139107] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:16,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:16,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:57:16,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404189634] [2024-06-20 18:57:16,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:16,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:57:16,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:16,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:57:16,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:57:16,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-20 18:57:16,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-20 18:57:16,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:16,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-20 18:57:16,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:17,203 INFO L124 PetriNetUnfolderBase]: 216/409 cut-off events. [2024-06-20 18:57:17,203 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2024-06-20 18:57:17,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1099 conditions, 409 events. 216/409 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1632 event pairs, 78 based on Foata normal form. 2/406 useless extension candidates. Maximal degree in co-relation 1084. Up to 352 conditions per place. [2024-06-20 18:57:17,206 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 9 changer transitions 0/49 dead transitions. [2024-06-20 18:57:17,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 261 flow [2024-06-20 18:57:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:57:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:57:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-20 18:57:17,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5353535353535354 [2024-06-20 18:57:17,209 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 6 states and 106 transitions. [2024-06-20 18:57:17,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 261 flow [2024-06-20 18:57:17,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 49 transitions, 246 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-20 18:57:17,211 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 147 flow [2024-06-20 18:57:17,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2024-06-20 18:57:17,211 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2024-06-20 18:57:17,212 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 147 flow [2024-06-20 18:57:17,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-20 18:57:17,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:17,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:17,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:57:17,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:57:17,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1801849858, now seen corresponding path program 1 times [2024-06-20 18:57:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971421109] [2024-06-20 18:57:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:22,821 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-20 18:57:22,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971421109] [2024-06-20 18:57:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971421109] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:22,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:57:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957149478] [2024-06-20 18:57:22,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:22,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:57:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:57:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:57:22,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-20 18:57:22,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 147 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:22,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:22,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-20 18:57:22,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:23,359 INFO L124 PetriNetUnfolderBase]: 213/403 cut-off events. [2024-06-20 18:57:23,360 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2024-06-20 18:57:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1167 conditions, 403 events. 213/403 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1579 event pairs, 57 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 1151. Up to 338 conditions per place. [2024-06-20 18:57:23,362 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 39 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2024-06-20 18:57:23,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 309 flow [2024-06-20 18:57:23,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:57:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:57:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-20 18:57:23,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5281385281385281 [2024-06-20 18:57:23,364 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 147 flow. Second operand 7 states and 122 transitions. [2024-06-20 18:57:23,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 309 flow [2024-06-20 18:57:23,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 288 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-20 18:57:23,366 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 171 flow [2024-06-20 18:57:23,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-06-20 18:57:23,367 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-20 18:57:23,367 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 171 flow [2024-06-20 18:57:23,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:23,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:23,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:23,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:57:23,368 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:57:23,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:23,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1302825794, now seen corresponding path program 1 times [2024-06-20 18:57:23,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:23,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004797206] [2024-06-20 18:57:23,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:23,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:57:32,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:32,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004797206] [2024-06-20 18:57:32,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004797206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:32,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:32,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:57:32,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476143938] [2024-06-20 18:57:32,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:32,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:57:32,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:32,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:57:32,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:57:32,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-20 18:57:32,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:32,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:32,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-20 18:57:32,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:32,824 INFO L124 PetriNetUnfolderBase]: 165/349 cut-off events. [2024-06-20 18:57:32,824 INFO L125 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2024-06-20 18:57:32,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 349 events. 165/349 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1435 event pairs, 46 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 1032. Up to 291 conditions per place. [2024-06-20 18:57:32,828 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 29 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-06-20 18:57:32,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 259 flow [2024-06-20 18:57:32,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:57:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:57:32,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2024-06-20 18:57:32,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-06-20 18:57:32,830 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 171 flow. Second operand 5 states and 79 transitions. [2024-06-20 18:57:32,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 259 flow [2024-06-20 18:57:32,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 232 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:57:32,835 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 171 flow [2024-06-20 18:57:32,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2024-06-20 18:57:32,837 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-06-20 18:57:32,837 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 171 flow [2024-06-20 18:57:32,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:32,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:32,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:57:32,838 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-20 18:57:32,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1748088052, now seen corresponding path program 1 times [2024-06-20 18:57:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:32,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303544981] [2024-06-20 18:57:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:40,719 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-20 18:57:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:40,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303544981] [2024-06-20 18:57:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303544981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:40,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:57:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794516000] [2024-06-20 18:57:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:40,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:57:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:40,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:57:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:57:40,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-20 18:57:40,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 171 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:40,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:40,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-20 18:57:40,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:41,110 INFO L124 PetriNetUnfolderBase]: 191/383 cut-off events. [2024-06-20 18:57:41,110 INFO L125 PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES. [2024-06-20 18:57:41,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 383 events. 191/383 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1545 event pairs, 55 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 1204. Up to 335 conditions per place. [2024-06-20 18:57:41,112 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 31 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-20 18:57:41,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 45 transitions, 271 flow [2024-06-20 18:57:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:57:41,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:57:41,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2024-06-20 18:57:41,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2024-06-20 18:57:41,114 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 171 flow. Second operand 6 states and 87 transitions. [2024-06-20 18:57:41,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 45 transitions, 271 flow [2024-06-20 18:57:41,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 260 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 18:57:41,117 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 193 flow [2024-06-20 18:57:41,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=193, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-20 18:57:41,118 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2024-06-20 18:57:41,119 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 193 flow [2024-06-20 18:57:41,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:41,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:41,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:41,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:57:41,119 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-20 18:57:41,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1705016449, now seen corresponding path program 1 times [2024-06-20 18:57:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642739284] [2024-06-20 18:57:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:57:51,166 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-20 18:57:51,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:57:51,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642739284] [2024-06-20 18:57:51,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642739284] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:57:51,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:57:51,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:57:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127434059] [2024-06-20 18:57:51,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:57:51,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:57:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:57:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:57:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:57:51,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-20 18:57:51,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:51,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:57:51,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-20 18:57:51,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:57:51,677 INFO L124 PetriNetUnfolderBase]: 209/404 cut-off events. [2024-06-20 18:57:51,677 INFO L125 PetriNetUnfolderBase]: For 1514/1514 co-relation queries the response was YES. [2024-06-20 18:57:51,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1412 conditions, 404 events. 209/404 cut-off events. For 1514/1514 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1629 event pairs, 61 based on Foata normal form. 1/404 useless extension candidates. Maximal degree in co-relation 1391. Up to 348 conditions per place. [2024-06-20 18:57:51,683 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 35 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2024-06-20 18:57:51,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 50 transitions, 309 flow [2024-06-20 18:57:51,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:57:51,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:57:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-20 18:57:51,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-20 18:57:51,685 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 193 flow. Second operand 6 states and 90 transitions. [2024-06-20 18:57:51,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 50 transitions, 309 flow [2024-06-20 18:57:51,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 292 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:57:51,688 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 209 flow [2024-06-20 18:57:51,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-20 18:57:51,690 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2024-06-20 18:57:51,691 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 209 flow [2024-06-20 18:57:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:57:51,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:57:51,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:57:51,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:57:51,691 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:57:51,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:57:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash -2114850143, now seen corresponding path program 2 times [2024-06-20 18:57:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:57:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746520470] [2024-06-20 18:57:51,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:57:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:57:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:01,902 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-20 18:58:01,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:01,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746520470] [2024-06-20 18:58:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746520470] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:01,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:01,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:58:01,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990193294] [2024-06-20 18:58:01,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:01,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:58:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:58:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:58:02,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-20 18:58:02,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:02,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:02,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-20 18:58:02,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:02,378 INFO L124 PetriNetUnfolderBase]: 207/401 cut-off events. [2024-06-20 18:58:02,378 INFO L125 PetriNetUnfolderBase]: For 1860/1860 co-relation queries the response was YES. [2024-06-20 18:58:02,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 401 events. 207/401 cut-off events. For 1860/1860 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1606 event pairs, 61 based on Foata normal form. 1/401 useless extension candidates. Maximal degree in co-relation 1464. Up to 339 conditions per place. [2024-06-20 18:58:02,382 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2024-06-20 18:58:02,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 337 flow [2024-06-20 18:58:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:58:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:58:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 103 transitions. [2024-06-20 18:58:02,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4458874458874459 [2024-06-20 18:58:02,383 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 209 flow. Second operand 7 states and 103 transitions. [2024-06-20 18:58:02,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 337 flow [2024-06-20 18:58:02,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 320 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 18:58:02,387 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 237 flow [2024-06-20 18:58:02,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=237, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-06-20 18:58:02,388 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 21 predicate places. [2024-06-20 18:58:02,388 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 237 flow [2024-06-20 18:58:02,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:02,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:02,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:02,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:58:02,389 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 18:58:02,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 705926785, now seen corresponding path program 1 times [2024-06-20 18:58:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107797117] [2024-06-20 18:58:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:02,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:09,037 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-20 18:58:09,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:09,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107797117] [2024-06-20 18:58:09,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107797117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:09,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:09,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795114087] [2024-06-20 18:58:09,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:09,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:09,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:09,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:09,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2024-06-20 18:58:09,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 237 flow. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:09,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:09,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2024-06-20 18:58:09,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:09,639 INFO L124 PetriNetUnfolderBase]: 221/411 cut-off events. [2024-06-20 18:58:09,640 INFO L125 PetriNetUnfolderBase]: For 2274/2274 co-relation queries the response was YES. [2024-06-20 18:58:09,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1583 conditions, 411 events. 221/411 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1567 event pairs, 39 based on Foata normal form. 4/414 useless extension candidates. Maximal degree in co-relation 1561. Up to 324 conditions per place. [2024-06-20 18:58:09,642 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 46 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-20 18:58:09,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 395 flow [2024-06-20 18:58:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-20 18:58:09,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037878787878788 [2024-06-20 18:58:09,644 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 237 flow. Second operand 8 states and 133 transitions. [2024-06-20 18:58:09,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 395 flow [2024-06-20 18:58:09,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 366 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 18:58:09,646 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 224 flow [2024-06-20 18:58:09,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2024-06-20 18:58:09,648 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2024-06-20 18:58:09,648 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 224 flow [2024-06-20 18:58:09,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:09,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:09,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:09,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 18:58:09,649 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-20 18:58:09,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:09,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2114840223, now seen corresponding path program 1 times [2024-06-20 18:58:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671384317] [2024-06-20 18:58:09,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:09,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:19,910 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-20 18:58:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671384317] [2024-06-20 18:58:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671384317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:19,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758555416] [2024-06-20 18:58:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:19,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:19,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:19,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:20,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-20 18:58:20,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 224 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:20,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:20,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-20 18:58:20,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:20,318 INFO L124 PetriNetUnfolderBase]: 188/370 cut-off events. [2024-06-20 18:58:20,319 INFO L125 PetriNetUnfolderBase]: For 2129/2129 co-relation queries the response was YES. [2024-06-20 18:58:20,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 370 events. 188/370 cut-off events. For 2129/2129 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1453 event pairs, 49 based on Foata normal form. 1/370 useless extension candidates. Maximal degree in co-relation 1419. Up to 323 conditions per place. [2024-06-20 18:58:20,322 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2024-06-20 18:58:20,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 340 flow [2024-06-20 18:58:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:58:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:58:20,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-20 18:58:20,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-20 18:58:20,323 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 224 flow. Second operand 7 states and 98 transitions. [2024-06-20 18:58:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 340 flow [2024-06-20 18:58:20,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 51 transitions, 308 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 18:58:20,326 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 231 flow [2024-06-20 18:58:20,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-20 18:58:20,326 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 24 predicate places. [2024-06-20 18:58:20,326 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 231 flow [2024-06-20 18:58:20,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:58:20,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:20,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:20,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 18:58:20,327 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-20 18:58:20,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1372199399, now seen corresponding path program 1 times [2024-06-20 18:58:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793286297] [2024-06-20 18:58:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:20,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:28,259 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-20 18:58:28,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:28,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793286297] [2024-06-20 18:58:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793286297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:28,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404256502] [2024-06-20 18:58:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:28,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:28,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:28,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:28,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:58:28,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 231 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-20 18:58:28,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:28,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:58:28,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:28,842 INFO L124 PetriNetUnfolderBase]: 228/426 cut-off events. [2024-06-20 18:58:28,842 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2024-06-20 18:58:28,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1719 conditions, 426 events. 228/426 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1632 event pairs, 58 based on Foata normal form. 1/426 useless extension candidates. Maximal degree in co-relation 1694. Up to 363 conditions per place. [2024-06-20 18:58:28,845 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 42 selfloop transitions, 15 changer transitions 0/62 dead transitions. [2024-06-20 18:58:28,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 423 flow [2024-06-20 18:58:28,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-20 18:58:28,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053030303030303 [2024-06-20 18:58:28,847 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 231 flow. Second operand 8 states and 107 transitions. [2024-06-20 18:58:28,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 423 flow [2024-06-20 18:58:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 62 transitions, 398 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 18:58:28,852 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 313 flow [2024-06-20 18:58:28,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2024-06-20 18:58:28,853 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 30 predicate places. [2024-06-20 18:58:28,853 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 313 flow [2024-06-20 18:58:28,853 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-20 18:58:28,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:28,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:28,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 18:58:28,854 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-20 18:58:28,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1124416889, now seen corresponding path program 2 times [2024-06-20 18:58:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:28,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812811625] [2024-06-20 18:58:28,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:38,285 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-20 18:58:38,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812811625] [2024-06-20 18:58:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812811625] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:38,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:38,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:38,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578364439] [2024-06-20 18:58:38,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:38,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:38,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:38,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:38,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:38,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:58:38,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 313 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-20 18:58:38,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:38,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:58:38,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:38,781 INFO L124 PetriNetUnfolderBase]: 235/438 cut-off events. [2024-06-20 18:58:38,781 INFO L125 PetriNetUnfolderBase]: For 3567/3569 co-relation queries the response was YES. [2024-06-20 18:58:38,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 438 events. 235/438 cut-off events. For 3567/3569 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1686 event pairs, 55 based on Foata normal form. 3/440 useless extension candidates. Maximal degree in co-relation 1865. Up to 373 conditions per place. [2024-06-20 18:58:38,784 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 47 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2024-06-20 18:58:38,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 521 flow [2024-06-20 18:58:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-20 18:58:38,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 18:58:38,785 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 313 flow. Second operand 8 states and 110 transitions. [2024-06-20 18:58:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 521 flow [2024-06-20 18:58:38,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 499 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-20 18:58:38,789 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 386 flow [2024-06-20 18:58:38,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=386, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2024-06-20 18:58:38,789 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 37 predicate places. [2024-06-20 18:58:38,789 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 386 flow [2024-06-20 18:58:38,790 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-20 18:58:38,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:38,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:38,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 18:58:38,790 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-20 18:58:38,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:38,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1372019909, now seen corresponding path program 3 times [2024-06-20 18:58:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:38,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424656939] [2024-06-20 18:58:38,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:38,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:46,874 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-20 18:58:46,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:46,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424656939] [2024-06-20 18:58:46,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424656939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640408179] [2024-06-20 18:58:46,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:46,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:46,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:46,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:58:46,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 386 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-20 18:58:46,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:46,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:58:46,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:47,321 INFO L124 PetriNetUnfolderBase]: 241/448 cut-off events. [2024-06-20 18:58:47,321 INFO L125 PetriNetUnfolderBase]: For 4272/4272 co-relation queries the response was YES. [2024-06-20 18:58:47,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 448 events. 241/448 cut-off events. For 4272/4272 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1711 event pairs, 60 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 2010. Up to 377 conditions per place. [2024-06-20 18:58:47,325 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 44 selfloop transitions, 21 changer transitions 0/70 dead transitions. [2024-06-20 18:58:47,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 70 transitions, 573 flow [2024-06-20 18:58:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:47,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-20 18:58:47,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-20 18:58:47,326 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 386 flow. Second operand 8 states and 108 transitions. [2024-06-20 18:58:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 70 transitions, 573 flow [2024-06-20 18:58:47,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 70 transitions, 526 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 18:58:47,330 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 430 flow [2024-06-20 18:58:47,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=430, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-06-20 18:58:47,331 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 41 predicate places. [2024-06-20 18:58:47,331 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 430 flow [2024-06-20 18:58:47,331 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-20 18:58:47,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:47,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:47,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 18:58:47,332 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-20 18:58:47,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1587960153, now seen corresponding path program 4 times [2024-06-20 18:58:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:47,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805115592] [2024-06-20 18:58:47,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:47,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:58:57,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-20 18:58:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:58:57,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805115592] [2024-06-20 18:58:57,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805115592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:58:57,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:58:57,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:58:57,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795011741] [2024-06-20 18:58:57,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:58:57,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:58:57,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:58:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:58:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:58:57,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:58:57,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 430 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-20 18:58:57,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:58:57,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:58:57,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:58:57,672 INFO L124 PetriNetUnfolderBase]: 244/453 cut-off events. [2024-06-20 18:58:57,672 INFO L125 PetriNetUnfolderBase]: For 5015/5015 co-relation queries the response was YES. [2024-06-20 18:58:57,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2159 conditions, 453 events. 244/453 cut-off events. For 5015/5015 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1737 event pairs, 55 based on Foata normal form. 1/453 useless extension candidates. Maximal degree in co-relation 2125. Up to 388 conditions per place. [2024-06-20 18:58:57,676 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 53 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-20 18:58:57,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 647 flow [2024-06-20 18:58:57,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:58:57,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:58:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-20 18:58:57,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 18:58:57,677 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 430 flow. Second operand 8 states and 110 transitions. [2024-06-20 18:58:57,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 647 flow [2024-06-20 18:58:57,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 77 transitions, 596 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 18:58:57,682 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 487 flow [2024-06-20 18:58:57,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-06-20 18:58:57,682 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 46 predicate places. [2024-06-20 18:58:57,683 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 487 flow [2024-06-20 18:58:57,683 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-20 18:58:57,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:58:57,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:58:57,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 18:58:57,683 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-20 18:58:57,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:58:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1372019661, now seen corresponding path program 1 times [2024-06-20 18:58:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:58:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654510531] [2024-06-20 18:58:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:58:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:58:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:07,766 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-20 18:59:07,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:07,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654510531] [2024-06-20 18:59:07,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654510531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:07,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:07,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:59:07,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847737131] [2024-06-20 18:59:07,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:07,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:59:07,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:07,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:59:07,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:59:07,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:07,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 487 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-20 18:59:07,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:07,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:07,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:08,283 INFO L124 PetriNetUnfolderBase]: 245/456 cut-off events. [2024-06-20 18:59:08,284 INFO L125 PetriNetUnfolderBase]: For 5518/5518 co-relation queries the response was YES. [2024-06-20 18:59:08,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2206 conditions, 456 events. 245/456 cut-off events. For 5518/5518 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1766 event pairs, 57 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 2169. Up to 395 conditions per place. [2024-06-20 18:59:08,288 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 48 selfloop transitions, 16 changer transitions 0/76 dead transitions. [2024-06-20 18:59:08,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 76 transitions, 647 flow [2024-06-20 18:59:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:59:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:59:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-20 18:59:08,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2024-06-20 18:59:08,289 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 487 flow. Second operand 7 states and 95 transitions. [2024-06-20 18:59:08,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 76 transitions, 647 flow [2024-06-20 18:59:08,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 76 transitions, 607 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-20 18:59:08,294 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 501 flow [2024-06-20 18:59:08,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=501, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-06-20 18:59:08,294 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-06-20 18:59:08,294 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 501 flow [2024-06-20 18:59:08,295 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-20 18:59:08,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:08,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 18:59:08,295 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-20 18:59:08,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:08,295 INFO L85 PathProgramCache]: Analyzing trace with hash 580417491, now seen corresponding path program 2 times [2024-06-20 18:59:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251320283] [2024-06-20 18:59:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:17,525 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-20 18:59:17,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251320283] [2024-06-20 18:59:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251320283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 18:59:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112721511] [2024-06-20 18:59:17,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:17,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 18:59:17,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:17,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 18:59:17,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 18:59:17,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:17,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 501 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-20 18:59:17,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:17,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:17,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:17,965 INFO L124 PetriNetUnfolderBase]: 248/464 cut-off events. [2024-06-20 18:59:17,965 INFO L125 PetriNetUnfolderBase]: For 6178/6178 co-relation queries the response was YES. [2024-06-20 18:59:17,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2313 conditions, 464 events. 248/464 cut-off events. For 6178/6178 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1830 event pairs, 62 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 2275. Up to 400 conditions per place. [2024-06-20 18:59:17,969 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 50 selfloop transitions, 21 changer transitions 0/83 dead transitions. [2024-06-20 18:59:17,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 83 transitions, 747 flow [2024-06-20 18:59:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:59:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:59:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-20 18:59:17,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-20 18:59:17,970 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 501 flow. Second operand 8 states and 108 transitions. [2024-06-20 18:59:17,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 83 transitions, 747 flow [2024-06-20 18:59:17,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 83 transitions, 701 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 18:59:17,975 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 569 flow [2024-06-20 18:59:17,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=569, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2024-06-20 18:59:17,976 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 54 predicate places. [2024-06-20 18:59:17,976 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 569 flow [2024-06-20 18:59:17,976 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-20 18:59:17,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:17,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:17,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 18:59:17,977 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-20 18:59:17,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 580120821, now seen corresponding path program 3 times [2024-06-20 18:59:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082314345] [2024-06-20 18:59:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:28,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-20 18:59:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:28,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082314345] [2024-06-20 18:59:28,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082314345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:28,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:28,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:59:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894256288] [2024-06-20 18:59:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:28,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:59:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:59:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:59:28,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:28,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 569 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-20 18:59:28,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:28,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:28,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:28,998 INFO L124 PetriNetUnfolderBase]: 249/464 cut-off events. [2024-06-20 18:59:28,999 INFO L125 PetriNetUnfolderBase]: For 6879/6879 co-relation queries the response was YES. [2024-06-20 18:59:29,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2384 conditions, 464 events. 249/464 cut-off events. For 6879/6879 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1836 event pairs, 60 based on Foata normal form. 1/464 useless extension candidates. Maximal degree in co-relation 2344. Up to 386 conditions per place. [2024-06-20 18:59:29,002 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 45 selfloop transitions, 23 changer transitions 0/80 dead transitions. [2024-06-20 18:59:29,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 80 transitions, 719 flow [2024-06-20 18:59:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 18:59:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 18:59:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-20 18:59:29,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2024-06-20 18:59:29,004 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 569 flow. Second operand 7 states and 96 transitions. [2024-06-20 18:59:29,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 80 transitions, 719 flow [2024-06-20 18:59:29,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 80 transitions, 674 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-20 18:59:29,009 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 575 flow [2024-06-20 18:59:29,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=575, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2024-06-20 18:59:29,010 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2024-06-20 18:59:29,010 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 575 flow [2024-06-20 18:59:29,010 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-20 18:59:29,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:29,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:29,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 18:59:29,011 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-20 18:59:29,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:29,011 INFO L85 PathProgramCache]: Analyzing trace with hash 580120573, now seen corresponding path program 5 times [2024-06-20 18:59:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:29,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21249917] [2024-06-20 18:59:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:29,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:29,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:38,309 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-20 18:59:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:38,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21249917] [2024-06-20 18:59:38,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21249917] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:59:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747129681] [2024-06-20 18:59:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:38,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:59:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:38,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:59:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:59:38,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:38,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 575 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-20 18:59:38,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:38,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:38,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:38,854 INFO L124 PetriNetUnfolderBase]: 256/472 cut-off events. [2024-06-20 18:59:38,855 INFO L125 PetriNetUnfolderBase]: For 7901/7901 co-relation queries the response was YES. [2024-06-20 18:59:38,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 472 events. 256/472 cut-off events. For 7901/7901 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1840 event pairs, 56 based on Foata normal form. 1/472 useless extension candidates. Maximal degree in co-relation 2484. Up to 374 conditions per place. [2024-06-20 18:59:38,873 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 47 selfloop transitions, 32 changer transitions 0/88 dead transitions. [2024-06-20 18:59:38,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 88 transitions, 849 flow [2024-06-20 18:59:38,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:59:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:59:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-20 18:59:38,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 18:59:38,890 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 575 flow. Second operand 8 states and 110 transitions. [2024-06-20 18:59:38,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 88 transitions, 849 flow [2024-06-20 18:59:38,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 88 transitions, 800 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-20 18:59:38,897 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 655 flow [2024-06-20 18:59:38,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=655, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2024-06-20 18:59:38,897 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 61 predicate places. [2024-06-20 18:59:38,897 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 655 flow [2024-06-20 18:59:38,898 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-20 18:59:38,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:38,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:38,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 18:59:38,898 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-20 18:59:38,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 300036699, now seen corresponding path program 6 times [2024-06-20 18:59:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:38,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124113566] [2024-06-20 18:59:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:48,586 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-20 18:59:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124113566] [2024-06-20 18:59:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124113566] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:59:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361724163] [2024-06-20 18:59:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:48,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:59:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:59:48,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:59:48,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:48,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 655 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-20 18:59:48,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:48,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:48,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:48,991 INFO L124 PetriNetUnfolderBase]: 254/469 cut-off events. [2024-06-20 18:59:48,992 INFO L125 PetriNetUnfolderBase]: For 8708/8708 co-relation queries the response was YES. [2024-06-20 18:59:48,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 469 events. 254/469 cut-off events. For 8708/8708 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1816 event pairs, 56 based on Foata normal form. 1/469 useless extension candidates. Maximal degree in co-relation 2538. Up to 390 conditions per place. [2024-06-20 18:59:48,996 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 55 selfloop transitions, 24 changer transitions 0/88 dead transitions. [2024-06-20 18:59:48,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 88 transitions, 839 flow [2024-06-20 18:59:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:59:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:59:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-20 18:59:48,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 18:59:48,997 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 655 flow. Second operand 8 states and 110 transitions. [2024-06-20 18:59:48,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 88 transitions, 839 flow [2024-06-20 18:59:49,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 88 transitions, 791 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-20 18:59:49,004 INFO L231 Difference]: Finished difference. Result has 97 places, 78 transitions, 660 flow [2024-06-20 18:59:49,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=660, PETRI_PLACES=97, PETRI_TRANSITIONS=78} [2024-06-20 18:59:49,005 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-06-20 18:59:49,005 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 78 transitions, 660 flow [2024-06-20 18:59:49,005 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-20 18:59:49,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:49,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:49,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 18:59:49,006 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-20 18:59:49,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:49,006 INFO L85 PathProgramCache]: Analyzing trace with hash 411342336, now seen corresponding path program 1 times [2024-06-20 18:59:49,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:49,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32972584] [2024-06-20 18:59:49,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:59:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:58,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32972584] [2024-06-20 18:59:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32972584] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 18:59:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219670478] [2024-06-20 18:59:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:58,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 18:59:58,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:58,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 18:59:58,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 18:59:58,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 18:59:58,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 78 transitions, 660 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-20 18:59:58,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:58,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 18:59:58,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:59,081 INFO L124 PetriNetUnfolderBase]: 260/481 cut-off events. [2024-06-20 18:59:59,082 INFO L125 PetriNetUnfolderBase]: For 9738/9738 co-relation queries the response was YES. [2024-06-20 18:59:59,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 481 events. 260/481 cut-off events. For 9738/9738 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1893 event pairs, 53 based on Foata normal form. 2/482 useless extension candidates. Maximal degree in co-relation 2653. Up to 391 conditions per place. [2024-06-20 18:59:59,085 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 65 selfloop transitions, 21 changer transitions 0/95 dead transitions. [2024-06-20 18:59:59,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 95 transitions, 896 flow [2024-06-20 18:59:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:59:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:59:59,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-20 18:59:59,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-20 18:59:59,087 INFO L175 Difference]: Start difference. First operand has 97 places, 78 transitions, 660 flow. Second operand 8 states and 113 transitions. [2024-06-20 18:59:59,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 95 transitions, 896 flow [2024-06-20 18:59:59,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 810 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 18:59:59,094 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 647 flow [2024-06-20 18:59:59,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=647, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2024-06-20 18:59:59,095 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 66 predicate places. [2024-06-20 18:59:59,095 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 647 flow [2024-06-20 18:59:59,095 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-20 18:59:59,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:59,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:59,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 18:59:59,096 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-20 18:59:59,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 547166951, now seen corresponding path program 1 times [2024-06-20 18:59:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:59,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940961867] [2024-06-20 18:59:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:59,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:09,421 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-20 19:00:09,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:09,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940961867] [2024-06-20 19:00:09,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940961867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:09,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:09,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:00:09,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17277820] [2024-06-20 19:00:09,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:09,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:00:09,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:09,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:00:09,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:00:09,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:00:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 647 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:09,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:09,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:00:09,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:09,959 INFO L124 PetriNetUnfolderBase]: 278/501 cut-off events. [2024-06-20 19:00:09,959 INFO L125 PetriNetUnfolderBase]: For 10292/10292 co-relation queries the response was YES. [2024-06-20 19:00:09,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 501 events. 278/501 cut-off events. For 10292/10292 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1950 event pairs, 54 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 2800. Up to 441 conditions per place. [2024-06-20 19:00:09,963 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 65 selfloop transitions, 25 changer transitions 0/93 dead transitions. [2024-06-20 19:00:09,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 93 transitions, 877 flow [2024-06-20 19:00:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:00:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:00:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 19:00:09,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-20 19:00:09,964 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 647 flow. Second operand 8 states and 102 transitions. [2024-06-20 19:00:09,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 93 transitions, 877 flow [2024-06-20 19:00:09,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 93 transitions, 820 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:09,971 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 673 flow [2024-06-20 19:00:09,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-06-20 19:00:09,972 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-06-20 19:00:09,972 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 673 flow [2024-06-20 19:00:09,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:09,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:09,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:09,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:00:09,972 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-20 19:00:09,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash 411492066, now seen corresponding path program 2 times [2024-06-20 19:00:09,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232900269] [2024-06-20 19:00:09,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:20,060 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-20 19:00:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232900269] [2024-06-20 19:00:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232900269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:00:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547491631] [2024-06-20 19:00:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:20,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:00:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:20,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:00:20,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:00:20,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:00:20,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 673 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-20 19:00:20,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:20,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:00:20,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:20,598 INFO L124 PetriNetUnfolderBase]: 271/500 cut-off events. [2024-06-20 19:00:20,598 INFO L125 PetriNetUnfolderBase]: For 11698/11698 co-relation queries the response was YES. [2024-06-20 19:00:20,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 500 events. 271/500 cut-off events. For 11698/11698 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1990 event pairs, 52 based on Foata normal form. 2/501 useless extension candidates. Maximal degree in co-relation 2855. Up to 387 conditions per place. [2024-06-20 19:00:20,602 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 63 selfloop transitions, 25 changer transitions 0/98 dead transitions. [2024-06-20 19:00:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 98 transitions, 915 flow [2024-06-20 19:00:20,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:00:20,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:00:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-20 19:00:20,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42803030303030304 [2024-06-20 19:00:20,604 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 673 flow. Second operand 8 states and 113 transitions. [2024-06-20 19:00:20,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 98 transitions, 915 flow [2024-06-20 19:00:20,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 98 transitions, 852 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:20,612 INFO L231 Difference]: Finished difference. Result has 102 places, 84 transitions, 697 flow [2024-06-20 19:00:20,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=102, PETRI_TRANSITIONS=84} [2024-06-20 19:00:20,613 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2024-06-20 19:00:20,613 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 84 transitions, 697 flow [2024-06-20 19:00:20,613 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-20 19:00:20,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:20,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:00:20,614 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-20 19:00:20,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2138253474, now seen corresponding path program 3 times [2024-06-20 19:00:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569441475] [2024-06-20 19:00:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:30,760 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-20 19:00:30,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:30,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569441475] [2024-06-20 19:00:30,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569441475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:30,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:30,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:00:30,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935932004] [2024-06-20 19:00:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:30,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:00:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:30,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:00:30,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:00:30,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:00:30,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 84 transitions, 697 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-20 19:00:30,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:30,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:00:30,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:31,224 INFO L124 PetriNetUnfolderBase]: 277/512 cut-off events. [2024-06-20 19:00:31,224 INFO L125 PetriNetUnfolderBase]: For 13012/13012 co-relation queries the response was YES. [2024-06-20 19:00:31,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3043 conditions, 512 events. 277/512 cut-off events. For 13012/13012 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2064 event pairs, 54 based on Foata normal form. 2/513 useless extension candidates. Maximal degree in co-relation 2996. Up to 377 conditions per place. [2024-06-20 19:00:31,231 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 59 selfloop transitions, 29 changer transitions 0/98 dead transitions. [2024-06-20 19:00:31,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 98 transitions, 937 flow [2024-06-20 19:00:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:00:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:00:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 19:00:31,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-20 19:00:31,240 INFO L175 Difference]: Start difference. First operand has 102 places, 84 transitions, 697 flow. Second operand 8 states and 112 transitions. [2024-06-20 19:00:31,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 98 transitions, 937 flow [2024-06-20 19:00:31,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 870 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:31,252 INFO L231 Difference]: Finished difference. Result has 104 places, 86 transitions, 728 flow [2024-06-20 19:00:31,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=104, PETRI_TRANSITIONS=86} [2024-06-20 19:00:31,259 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2024-06-20 19:00:31,259 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 86 transitions, 728 flow [2024-06-20 19:00:31,259 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-20 19:00:31,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:31,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:31,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:00:31,260 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-20 19:00:31,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -2138253257, now seen corresponding path program 2 times [2024-06-20 19:00:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:31,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487357794] [2024-06-20 19:00:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:31,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:42,432 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-20 19:00:42,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:42,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487357794] [2024-06-20 19:00:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487357794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:42,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:42,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:00:42,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289606560] [2024-06-20 19:00:42,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:00:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:00:42,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:00:42,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:00:42,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 86 transitions, 728 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:42,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:42,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:00:42,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:42,882 INFO L124 PetriNetUnfolderBase]: 298/538 cut-off events. [2024-06-20 19:00:42,883 INFO L125 PetriNetUnfolderBase]: For 13931/13931 co-relation queries the response was YES. [2024-06-20 19:00:42,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 538 events. 298/538 cut-off events. For 13931/13931 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2140 event pairs, 56 based on Foata normal form. 1/538 useless extension candidates. Maximal degree in co-relation 3217. Up to 445 conditions per place. [2024-06-20 19:00:42,891 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 33 changer transitions 0/100 dead transitions. [2024-06-20 19:00:42,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 100 transitions, 1046 flow [2024-06-20 19:00:42,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:00:42,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:00:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-20 19:00:42,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-20 19:00:42,892 INFO L175 Difference]: Start difference. First operand has 104 places, 86 transitions, 728 flow. Second operand 8 states and 104 transitions. [2024-06-20 19:00:42,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 100 transitions, 1046 flow [2024-06-20 19:00:42,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 100 transitions, 966 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:00:42,904 INFO L231 Difference]: Finished difference. Result has 106 places, 90 transitions, 776 flow [2024-06-20 19:00:42,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=776, PETRI_PLACES=106, PETRI_TRANSITIONS=90} [2024-06-20 19:00:42,909 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 74 predicate places. [2024-06-20 19:00:42,910 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 90 transitions, 776 flow [2024-06-20 19:00:42,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:42,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:42,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:42,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:00:42,911 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-20 19:00:42,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2138245817, now seen corresponding path program 3 times [2024-06-20 19:00:42,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:42,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438559548] [2024-06-20 19:00:42,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:42,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:42,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:52,572 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-20 19:00:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:52,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438559548] [2024-06-20 19:00:52,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438559548] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:52,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:52,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:00:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105888000] [2024-06-20 19:00:52,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:00:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:52,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:00:52,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:00:52,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:00:52,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 90 transitions, 776 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:52,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:52,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:00:52,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:53,014 INFO L124 PetriNetUnfolderBase]: 296/535 cut-off events. [2024-06-20 19:00:53,014 INFO L125 PetriNetUnfolderBase]: For 14628/14628 co-relation queries the response was YES. [2024-06-20 19:00:53,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3264 conditions, 535 events. 296/535 cut-off events. For 14628/14628 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2141 event pairs, 56 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 3215. Up to 443 conditions per place. [2024-06-20 19:00:53,019 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 60 selfloop transitions, 36 changer transitions 0/99 dead transitions. [2024-06-20 19:00:53,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 990 flow [2024-06-20 19:00:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:00:53,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:00:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 19:00:53,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2024-06-20 19:00:53,021 INFO L175 Difference]: Start difference. First operand has 106 places, 90 transitions, 776 flow. Second operand 8 states and 102 transitions. [2024-06-20 19:00:53,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 990 flow [2024-06-20 19:00:53,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 99 transitions, 917 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-20 19:00:53,031 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 781 flow [2024-06-20 19:00:53,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=781, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2024-06-20 19:00:53,031 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 78 predicate places. [2024-06-20 19:00:53,032 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 781 flow [2024-06-20 19:00:53,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:00:53,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:53,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:53,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:00:53,032 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-20 19:00:53,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2138245538, now seen corresponding path program 1 times [2024-06-20 19:00:53,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:53,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763276337] [2024-06-20 19:00:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:53,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:02,942 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-20 19:01:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763276337] [2024-06-20 19:01:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763276337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:02,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082223394] [2024-06-20 19:01:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:02,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:02,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:03,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:01:03,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 781 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-20 19:01:03,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:03,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:01:03,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:03,424 INFO L124 PetriNetUnfolderBase]: 281/522 cut-off events. [2024-06-20 19:01:03,424 INFO L125 PetriNetUnfolderBase]: For 15214/15214 co-relation queries the response was YES. [2024-06-20 19:01:03,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3187 conditions, 522 events. 281/522 cut-off events. For 15214/15214 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2149 event pairs, 54 based on Foata normal form. 1/522 useless extension candidates. Maximal degree in co-relation 3136. Up to 438 conditions per place. [2024-06-20 19:01:03,433 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 20 changer transitions 0/101 dead transitions. [2024-06-20 19:01:03,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 101 transitions, 985 flow [2024-06-20 19:01:03,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:01:03,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:01:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-20 19:01:03,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-06-20 19:01:03,435 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 781 flow. Second operand 8 states and 106 transitions. [2024-06-20 19:01:03,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 101 transitions, 985 flow [2024-06-20 19:01:03,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 101 transitions, 903 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:01:03,447 INFO L231 Difference]: Finished difference. Result has 111 places, 92 transitions, 763 flow [2024-06-20 19:01:03,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=763, PETRI_PLACES=111, PETRI_TRANSITIONS=92} [2024-06-20 19:01:03,447 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 79 predicate places. [2024-06-20 19:01:03,448 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 92 transitions, 763 flow [2024-06-20 19:01:03,448 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-20 19:01:03,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:03,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:03,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:01:03,448 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-20 19:01:03,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash -842237470, now seen corresponding path program 2 times [2024-06-20 19:01:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:03,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100199035] [2024-06-20 19:01:03,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:03,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:13,782 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-20 19:01:13,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:13,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100199035] [2024-06-20 19:01:13,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100199035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:13,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:13,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:13,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631529739] [2024-06-20 19:01:13,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:13,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:13,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:13,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:13,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:13,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:01:13,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 92 transitions, 763 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-20 19:01:13,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:13,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:01:13,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:14,264 INFO L124 PetriNetUnfolderBase]: 289/535 cut-off events. [2024-06-20 19:01:14,264 INFO L125 PetriNetUnfolderBase]: For 16577/16577 co-relation queries the response was YES. [2024-06-20 19:01:14,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 535 events. 289/535 cut-off events. For 16577/16577 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2185 event pairs, 54 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 3267. Up to 422 conditions per place. [2024-06-20 19:01:14,267 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 62 selfloop transitions, 32 changer transitions 0/111 dead transitions. [2024-06-20 19:01:14,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 1145 flow [2024-06-20 19:01:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:01:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:01:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-20 19:01:14,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41414141414141414 [2024-06-20 19:01:14,269 INFO L175 Difference]: Start difference. First operand has 111 places, 92 transitions, 763 flow. Second operand 9 states and 123 transitions. [2024-06-20 19:01:14,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 1145 flow [2024-06-20 19:01:14,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 111 transitions, 1099 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-20 19:01:14,281 INFO L231 Difference]: Finished difference. Result has 115 places, 99 transitions, 863 flow [2024-06-20 19:01:14,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=863, PETRI_PLACES=115, PETRI_TRANSITIONS=99} [2024-06-20 19:01:14,281 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 83 predicate places. [2024-06-20 19:01:14,282 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 99 transitions, 863 flow [2024-06-20 19:01:14,282 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-20 19:01:14,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:14,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:14,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:01:14,282 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-20 19:01:14,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -220931975, now seen corresponding path program 4 times [2024-06-20 19:01:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656604464] [2024-06-20 19:01:14,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:14,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:24,386 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-20 19:01:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656604464] [2024-06-20 19:01:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656604464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177925853] [2024-06-20 19:01:24,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:24,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:01:24,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 99 transitions, 863 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:01:24,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:24,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:01:24,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:24,925 INFO L124 PetriNetUnfolderBase]: 310/558 cut-off events. [2024-06-20 19:01:24,926 INFO L125 PetriNetUnfolderBase]: For 18224/18224 co-relation queries the response was YES. [2024-06-20 19:01:24,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 558 events. 310/558 cut-off events. For 18224/18224 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2229 event pairs, 55 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 3584. Up to 439 conditions per place. [2024-06-20 19:01:24,929 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 64 selfloop transitions, 47 changer transitions 0/114 dead transitions. [2024-06-20 19:01:24,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 114 transitions, 1227 flow [2024-06-20 19:01:24,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:01:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:01:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 19:01:24,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872053872053872 [2024-06-20 19:01:24,930 INFO L175 Difference]: Start difference. First operand has 115 places, 99 transitions, 863 flow. Second operand 9 states and 115 transitions. [2024-06-20 19:01:24,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 114 transitions, 1227 flow [2024-06-20 19:01:24,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 114 transitions, 1190 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 19:01:24,946 INFO L231 Difference]: Finished difference. Result has 120 places, 103 transitions, 989 flow [2024-06-20 19:01:24,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=989, PETRI_PLACES=120, PETRI_TRANSITIONS=103} [2024-06-20 19:01:24,947 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 88 predicate places. [2024-06-20 19:01:24,947 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 103 transitions, 989 flow [2024-06-20 19:01:24,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:01:24,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:24,948 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:24,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:01:24,948 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-20 19:01:24,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 803869054, now seen corresponding path program 4 times [2024-06-20 19:01:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517711622] [2024-06-20 19:01:24,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:35,809 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-20 19:01:35,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:35,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517711622] [2024-06-20 19:01:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517711622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:35,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:35,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132967708] [2024-06-20 19:01:35,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:35,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:35,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:35,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:01:35,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 103 transitions, 989 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-20 19:01:35,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:35,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:01:35,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:36,336 INFO L124 PetriNetUnfolderBase]: 296/547 cut-off events. [2024-06-20 19:01:36,336 INFO L125 PetriNetUnfolderBase]: For 19975/19975 co-relation queries the response was YES. [2024-06-20 19:01:36,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3707 conditions, 547 events. 296/547 cut-off events. For 19975/19975 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2245 event pairs, 53 based on Foata normal form. 2/548 useless extension candidates. Maximal degree in co-relation 3651. Up to 389 conditions per place. [2024-06-20 19:01:36,340 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 71 selfloop transitions, 33 changer transitions 0/118 dead transitions. [2024-06-20 19:01:36,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 118 transitions, 1267 flow [2024-06-20 19:01:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:01:36,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:01:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2024-06-20 19:01:36,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4175084175084175 [2024-06-20 19:01:36,349 INFO L175 Difference]: Start difference. First operand has 120 places, 103 transitions, 989 flow. Second operand 9 states and 124 transitions. [2024-06-20 19:01:36,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 118 transitions, 1267 flow [2024-06-20 19:01:36,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 118 transitions, 1193 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-06-20 19:01:36,366 INFO L231 Difference]: Finished difference. Result has 124 places, 105 transitions, 1024 flow [2024-06-20 19:01:36,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1024, PETRI_PLACES=124, PETRI_TRANSITIONS=105} [2024-06-20 19:01:36,366 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2024-06-20 19:01:36,366 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 105 transitions, 1024 flow [2024-06-20 19:01:36,366 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-20 19:01:36,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:36,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:01:36,367 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-20 19:01:36,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash -841911040, now seen corresponding path program 3 times [2024-06-20 19:01:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:36,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257086178] [2024-06-20 19:01:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:46,373 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-20 19:01:46,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:46,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257086178] [2024-06-20 19:01:46,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257086178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:46,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:46,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:46,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894242009] [2024-06-20 19:01:46,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:46,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:46,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:46,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:46,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:46,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:01:46,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 105 transitions, 1024 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-20 19:01:46,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:46,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:01:46,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:46,863 INFO L124 PetriNetUnfolderBase]: 291/541 cut-off events. [2024-06-20 19:01:46,863 INFO L125 PetriNetUnfolderBase]: For 19711/19711 co-relation queries the response was YES. [2024-06-20 19:01:46,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3650 conditions, 541 events. 291/541 cut-off events. For 19711/19711 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2246 event pairs, 54 based on Foata normal form. 1/541 useless extension candidates. Maximal degree in co-relation 3592. Up to 425 conditions per place. [2024-06-20 19:01:46,867 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 62 selfloop transitions, 35 changer transitions 0/116 dead transitions. [2024-06-20 19:01:46,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 116 transitions, 1304 flow [2024-06-20 19:01:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:01:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:01:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 19:01:46,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-20 19:01:46,868 INFO L175 Difference]: Start difference. First operand has 124 places, 105 transitions, 1024 flow. Second operand 9 states and 121 transitions. [2024-06-20 19:01:46,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 116 transitions, 1304 flow [2024-06-20 19:01:46,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 116 transitions, 1199 flow, removed 21 selfloop flow, removed 7 redundant places. [2024-06-20 19:01:46,888 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 994 flow [2024-06-20 19:01:46,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=994, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2024-06-20 19:01:46,889 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-06-20 19:01:46,889 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 994 flow [2024-06-20 19:01:46,889 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-20 19:01:46,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:46,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:46,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:01:46,890 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-20 19:01:46,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:46,890 INFO L85 PathProgramCache]: Analyzing trace with hash 803869271, now seen corresponding path program 5 times [2024-06-20 19:01:46,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:46,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930011696] [2024-06-20 19:01:46,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:46,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:56,874 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-20 19:01:56,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930011696] [2024-06-20 19:01:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930011696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:01:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970727325] [2024-06-20 19:01:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:56,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:01:56,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:01:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:01:57,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:01:57,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:01:57,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:57,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:01:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:57,370 INFO L124 PetriNetUnfolderBase]: 312/564 cut-off events. [2024-06-20 19:01:57,370 INFO L125 PetriNetUnfolderBase]: For 20982/20982 co-relation queries the response was YES. [2024-06-20 19:01:57,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 564 events. 312/564 cut-off events. For 20982/20982 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2287 event pairs, 55 based on Foata normal form. 1/564 useless extension candidates. Maximal degree in co-relation 3776. Up to 442 conditions per place. [2024-06-20 19:01:57,374 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 72 selfloop transitions, 43 changer transitions 0/118 dead transitions. [2024-06-20 19:01:57,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 118 transitions, 1344 flow [2024-06-20 19:01:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:01:57,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:01:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 19:01:57,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-20 19:01:57,376 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 994 flow. Second operand 9 states and 116 transitions. [2024-06-20 19:01:57,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 118 transitions, 1344 flow [2024-06-20 19:01:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 118 transitions, 1279 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:01:57,393 INFO L231 Difference]: Finished difference. Result has 128 places, 107 transitions, 1052 flow [2024-06-20 19:01:57,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1052, PETRI_PLACES=128, PETRI_TRANSITIONS=107} [2024-06-20 19:01:57,394 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2024-06-20 19:01:57,394 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 107 transitions, 1052 flow [2024-06-20 19:01:57,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:01:57,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:57,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:01:57,395 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-20 19:01:57,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:57,395 INFO L85 PathProgramCache]: Analyzing trace with hash 803876990, now seen corresponding path program 4 times [2024-06-20 19:01:57,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:57,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108108633] [2024-06-20 19:01:57,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:57,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:07,710 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-20 19:02:07,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108108633] [2024-06-20 19:02:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108108633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:02:07,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054176304] [2024-06-20 19:02:07,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:07,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:02:07,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:07,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:02:07,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:02:07,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:02:07,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 107 transitions, 1052 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-20 19:02:07,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:07,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:02:07,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:08,201 INFO L124 PetriNetUnfolderBase]: 292/543 cut-off events. [2024-06-20 19:02:08,201 INFO L125 PetriNetUnfolderBase]: For 21468/21468 co-relation queries the response was YES. [2024-06-20 19:02:08,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3682 conditions, 543 events. 292/543 cut-off events. For 21468/21468 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2251 event pairs, 54 based on Foata normal form. 1/543 useless extension candidates. Maximal degree in co-relation 3622. Up to 426 conditions per place. [2024-06-20 19:02:08,205 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 67 selfloop transitions, 31 changer transitions 0/118 dead transitions. [2024-06-20 19:02:08,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 118 transitions, 1280 flow [2024-06-20 19:02:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:02:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:02:08,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 19:02:08,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-20 19:02:08,207 INFO L175 Difference]: Start difference. First operand has 128 places, 107 transitions, 1052 flow. Second operand 9 states and 122 transitions. [2024-06-20 19:02:08,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 118 transitions, 1280 flow [2024-06-20 19:02:08,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 1149 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-20 19:02:08,228 INFO L231 Difference]: Finished difference. Result has 130 places, 108 transitions, 996 flow [2024-06-20 19:02:08,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=996, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2024-06-20 19:02:08,228 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 98 predicate places. [2024-06-20 19:02:08,229 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 996 flow [2024-06-20 19:02:08,229 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-20 19:02:08,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:08,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:08,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:02:08,229 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-20 19:02:08,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:08,230 INFO L85 PathProgramCache]: Analyzing trace with hash 803876711, now seen corresponding path program 6 times [2024-06-20 19:02:08,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:08,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512641466] [2024-06-20 19:02:08,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:08,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:18,574 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-20 19:02:18,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:18,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512641466] [2024-06-20 19:02:18,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512641466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:18,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:18,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:02:18,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224322163] [2024-06-20 19:02:18,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:18,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:02:18,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:18,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:02:18,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:02:18,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:02:18,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 108 transitions, 996 flow. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:02:18,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:18,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:02:18,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:19,037 INFO L124 PetriNetUnfolderBase]: 308/558 cut-off events. [2024-06-20 19:02:19,038 INFO L125 PetriNetUnfolderBase]: For 22384/22384 co-relation queries the response was YES. [2024-06-20 19:02:19,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3746 conditions, 558 events. 308/558 cut-off events. For 22384/22384 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2248 event pairs, 55 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 3686. Up to 437 conditions per place. [2024-06-20 19:02:19,057 INFO L140 encePairwiseOnDemand]: 24/33 looper letters, 73 selfloop transitions, 42 changer transitions 0/118 dead transitions. [2024-06-20 19:02:19,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 118 transitions, 1250 flow [2024-06-20 19:02:19,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:02:19,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:02:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 19:02:19,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-20 19:02:19,059 INFO L175 Difference]: Start difference. First operand has 130 places, 108 transitions, 996 flow. Second operand 9 states and 116 transitions. [2024-06-20 19:02:19,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 118 transitions, 1250 flow [2024-06-20 19:02:19,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 118 transitions, 1182 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 19:02:19,076 INFO L231 Difference]: Finished difference. Result has 133 places, 108 transitions, 1017 flow [2024-06-20 19:02:19,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1017, PETRI_PLACES=133, PETRI_TRANSITIONS=108} [2024-06-20 19:02:19,077 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-20 19:02:19,077 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 108 transitions, 1017 flow [2024-06-20 19:02:19,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 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-20 19:02:19,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:19,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:19,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:02:19,077 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-20 19:02:19,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash 813412094, now seen corresponding path program 1 times [2024-06-20 19:02:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105558482] [2024-06-20 19:02:19,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:30,926 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-20 19:02:30,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:30,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105558482] [2024-06-20 19:02:30,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105558482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:30,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:30,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:02:30,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789954810] [2024-06-20 19:02:30,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:30,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:02:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:30,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:02:30,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:02:31,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:02:31,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 108 transitions, 1017 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:31,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:31,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:02:31,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:31,407 INFO L124 PetriNetUnfolderBase]: 286/535 cut-off events. [2024-06-20 19:02:31,408 INFO L125 PetriNetUnfolderBase]: For 22837/22837 co-relation queries the response was YES. [2024-06-20 19:02:31,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3574 conditions, 535 events. 286/535 cut-off events. For 22837/22837 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2229 event pairs, 59 based on Foata normal form. 1/535 useless extension candidates. Maximal degree in co-relation 3513. Up to 461 conditions per place. [2024-06-20 19:02:31,412 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 83 selfloop transitions, 15 changer transitions 0/118 dead transitions. [2024-06-20 19:02:31,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 118 transitions, 1243 flow [2024-06-20 19:02:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:02:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:02:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:02:31,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-20 19:02:31,431 INFO L175 Difference]: Start difference. First operand has 133 places, 108 transitions, 1017 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:02:31,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 118 transitions, 1243 flow [2024-06-20 19:02:31,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 118 transitions, 1128 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:02:31,452 INFO L231 Difference]: Finished difference. Result has 133 places, 110 transitions, 953 flow [2024-06-20 19:02:31,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=953, PETRI_PLACES=133, PETRI_TRANSITIONS=110} [2024-06-20 19:02:31,453 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2024-06-20 19:02:31,453 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 110 transitions, 953 flow [2024-06-20 19:02:31,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:31,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:31,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:31,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:02:31,454 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-20 19:02:31,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash -133408936, now seen corresponding path program 1 times [2024-06-20 19:02:31,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:31,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611428583] [2024-06-20 19:02:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:41,430 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-20 19:02:41,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:41,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611428583] [2024-06-20 19:02:41,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611428583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:41,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:41,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:02:41,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079880411] [2024-06-20 19:02:41,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:41,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:02:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:41,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:02:41,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:02:41,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:02:41,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 110 transitions, 953 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:41,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:41,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:02:41,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:41,995 INFO L124 PetriNetUnfolderBase]: 288/536 cut-off events. [2024-06-20 19:02:41,996 INFO L125 PetriNetUnfolderBase]: For 23777/23777 co-relation queries the response was YES. [2024-06-20 19:02:41,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 536 events. 288/536 cut-off events. For 23777/23777 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2220 event pairs, 48 based on Foata normal form. 1/536 useless extension candidates. Maximal degree in co-relation 3543. Up to 425 conditions per place. [2024-06-20 19:02:42,013 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 92 selfloop transitions, 23 changer transitions 0/130 dead transitions. [2024-06-20 19:02:42,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 130 transitions, 1271 flow [2024-06-20 19:02:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:02:42,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:02:42,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-20 19:02:42,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-20 19:02:42,025 INFO L175 Difference]: Start difference. First operand has 133 places, 110 transitions, 953 flow. Second operand 9 states and 126 transitions. [2024-06-20 19:02:42,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 130 transitions, 1271 flow [2024-06-20 19:02:42,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 1180 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:02:42,047 INFO L231 Difference]: Finished difference. Result has 132 places, 112 transitions, 955 flow [2024-06-20 19:02:42,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=955, PETRI_PLACES=132, PETRI_TRANSITIONS=112} [2024-06-20 19:02:42,047 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 100 predicate places. [2024-06-20 19:02:42,048 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 112 transitions, 955 flow [2024-06-20 19:02:42,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:42,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:42,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:42,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:02:42,048 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-20 19:02:42,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:42,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2038479082, now seen corresponding path program 1 times [2024-06-20 19:02:42,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:42,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084902763] [2024-06-20 19:02:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:42,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:52,055 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-20 19:02:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084902763] [2024-06-20 19:02:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084902763] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:02:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162711777] [2024-06-20 19:02:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:52,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:02:52,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:52,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:02:52,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:02:52,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:02:52,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 112 transitions, 955 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:52,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:52,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:02:52,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:52,619 INFO L124 PetriNetUnfolderBase]: 310/562 cut-off events. [2024-06-20 19:02:52,619 INFO L125 PetriNetUnfolderBase]: For 25596/25596 co-relation queries the response was YES. [2024-06-20 19:02:52,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3777 conditions, 562 events. 310/562 cut-off events. For 25596/25596 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2306 event pairs, 50 based on Foata normal form. 2/563 useless extension candidates. Maximal degree in co-relation 3715. Up to 483 conditions per place. [2024-06-20 19:02:52,623 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 105 selfloop transitions, 23 changer transitions 0/131 dead transitions. [2024-06-20 19:02:52,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 131 transitions, 1285 flow [2024-06-20 19:02:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:02:52,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:02:52,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:02:52,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-20 19:02:52,626 INFO L175 Difference]: Start difference. First operand has 132 places, 112 transitions, 955 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:02:52,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 131 transitions, 1285 flow [2024-06-20 19:02:52,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 131 transitions, 1208 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-20 19:02:52,648 INFO L231 Difference]: Finished difference. Result has 134 places, 114 transitions, 959 flow [2024-06-20 19:02:52,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=134, PETRI_TRANSITIONS=114} [2024-06-20 19:02:52,648 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 102 predicate places. [2024-06-20 19:02:52,649 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 114 transitions, 959 flow [2024-06-20 19:02:52,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:02:52,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:52,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:52,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:02:52,649 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-20 19:02:52,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash -128640392, now seen corresponding path program 1 times [2024-06-20 19:02:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:52,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214480646] [2024-06-20 19:02:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:02,851 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-20 19:03:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214480646] [2024-06-20 19:03:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214480646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:02,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:02,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243871464] [2024-06-20 19:03:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:02,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:02,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:03,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:03,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 114 transitions, 959 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:03,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:03,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:03,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:03,328 INFO L124 PetriNetUnfolderBase]: 313/569 cut-off events. [2024-06-20 19:03:03,328 INFO L125 PetriNetUnfolderBase]: For 26605/26605 co-relation queries the response was YES. [2024-06-20 19:03:03,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3852 conditions, 569 events. 313/569 cut-off events. For 26605/26605 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2340 event pairs, 51 based on Foata normal form. 1/569 useless extension candidates. Maximal degree in co-relation 3789. Up to 498 conditions per place. [2024-06-20 19:03:03,337 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-06-20 19:03:03,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 128 transitions, 1263 flow [2024-06-20 19:03:03,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:03:03,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3771043771043771 [2024-06-20 19:03:03,338 INFO L175 Difference]: Start difference. First operand has 134 places, 114 transitions, 959 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:03:03,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 128 transitions, 1263 flow [2024-06-20 19:03:03,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 128 transitions, 1198 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:03:03,356 INFO L231 Difference]: Finished difference. Result has 136 places, 116 transitions, 981 flow [2024-06-20 19:03:03,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=981, PETRI_PLACES=136, PETRI_TRANSITIONS=116} [2024-06-20 19:03:03,357 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 104 predicate places. [2024-06-20 19:03:03,357 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 116 transitions, 981 flow [2024-06-20 19:03:03,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:03,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:03,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:03,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:03:03,357 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-20 19:03:03,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash -128640640, now seen corresponding path program 2 times [2024-06-20 19:03:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456045088] [2024-06-20 19:03:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:13,762 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-20 19:03:13,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:13,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456045088] [2024-06-20 19:03:13,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456045088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:13,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:13,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479345028] [2024-06-20 19:03:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:13,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:13,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 116 transitions, 981 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:13,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:13,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:13,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:14,359 INFO L124 PetriNetUnfolderBase]: 329/595 cut-off events. [2024-06-20 19:03:14,359 INFO L125 PetriNetUnfolderBase]: For 30240/30240 co-relation queries the response was YES. [2024-06-20 19:03:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 595 events. 329/595 cut-off events. For 30240/30240 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2467 event pairs, 49 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 4061. Up to 471 conditions per place. [2024-06-20 19:03:14,364 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 104 selfloop transitions, 30 changer transitions 0/137 dead transitions. [2024-06-20 19:03:14,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 1433 flow [2024-06-20 19:03:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 19:03:14,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-20 19:03:14,365 INFO L175 Difference]: Start difference. First operand has 136 places, 116 transitions, 981 flow. Second operand 9 states and 119 transitions. [2024-06-20 19:03:14,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 1433 flow [2024-06-20 19:03:14,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 1362 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:03:14,386 INFO L231 Difference]: Finished difference. Result has 138 places, 120 transitions, 1039 flow [2024-06-20 19:03:14,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1039, PETRI_PLACES=138, PETRI_TRANSITIONS=120} [2024-06-20 19:03:14,386 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 106 predicate places. [2024-06-20 19:03:14,386 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 120 transitions, 1039 flow [2024-06-20 19:03:14,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:14,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:14,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:14,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:03:14,387 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-20 19:03:14,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2033837452, now seen corresponding path program 3 times [2024-06-20 19:03:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462667655] [2024-06-20 19:03:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:24,729 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-20 19:03:24,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:24,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462667655] [2024-06-20 19:03:24,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462667655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:24,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:24,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:24,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768145526] [2024-06-20 19:03:24,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:24,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:24,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:24,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:24,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:24,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:24,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 120 transitions, 1039 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:24,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:24,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:24,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:25,326 INFO L124 PetriNetUnfolderBase]: 325/589 cut-off events. [2024-06-20 19:03:25,326 INFO L125 PetriNetUnfolderBase]: For 30488/30488 co-relation queries the response was YES. [2024-06-20 19:03:25,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4089 conditions, 589 events. 325/589 cut-off events. For 30488/30488 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2449 event pairs, 51 based on Foata normal form. 2/590 useless extension candidates. Maximal degree in co-relation 4024. Up to 468 conditions per place. [2024-06-20 19:03:25,331 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 104 selfloop transitions, 29 changer transitions 0/136 dead transitions. [2024-06-20 19:03:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 136 transitions, 1351 flow [2024-06-20 19:03:25,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 19:03:25,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2024-06-20 19:03:25,332 INFO L175 Difference]: Start difference. First operand has 138 places, 120 transitions, 1039 flow. Second operand 9 states and 119 transitions. [2024-06-20 19:03:25,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 136 transitions, 1351 flow [2024-06-20 19:03:25,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 136 transitions, 1275 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:25,357 INFO L231 Difference]: Finished difference. Result has 142 places, 120 transitions, 1026 flow [2024-06-20 19:03:25,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1026, PETRI_PLACES=142, PETRI_TRANSITIONS=120} [2024-06-20 19:03:25,367 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2024-06-20 19:03:25,368 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 1026 flow [2024-06-20 19:03:25,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:25,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:25,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:25,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:03:25,369 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-20 19:03:25,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1861347562, now seen corresponding path program 4 times [2024-06-20 19:03:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415211233] [2024-06-20 19:03:25,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:25,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:36,475 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-20 19:03:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415211233] [2024-06-20 19:03:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415211233] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:36,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:36,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:36,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840798894] [2024-06-20 19:03:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:36,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:36,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:36,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:36,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:36,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:36,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:36,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:36,981 INFO L124 PetriNetUnfolderBase]: 341/617 cut-off events. [2024-06-20 19:03:36,982 INFO L125 PetriNetUnfolderBase]: For 33669/33669 co-relation queries the response was YES. [2024-06-20 19:03:36,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4368 conditions, 617 events. 341/617 cut-off events. For 33669/33669 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2594 event pairs, 56 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 4301. Up to 439 conditions per place. [2024-06-20 19:03:36,986 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 97 selfloop transitions, 39 changer transitions 0/139 dead transitions. [2024-06-20 19:03:36,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 139 transitions, 1488 flow [2024-06-20 19:03:36,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:36,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-20 19:03:36,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40404040404040403 [2024-06-20 19:03:36,987 INFO L175 Difference]: Start difference. First operand has 142 places, 120 transitions, 1026 flow. Second operand 9 states and 120 transitions. [2024-06-20 19:03:36,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 139 transitions, 1488 flow [2024-06-20 19:03:37,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 1414 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:03:37,012 INFO L231 Difference]: Finished difference. Result has 143 places, 124 transitions, 1107 flow [2024-06-20 19:03:37,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1107, PETRI_PLACES=143, PETRI_TRANSITIONS=124} [2024-06-20 19:03:37,013 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 111 predicate places. [2024-06-20 19:03:37,013 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 124 transitions, 1107 flow [2024-06-20 19:03:37,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:37,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:37,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:37,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:03:37,014 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-20 19:03:37,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:37,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1861341052, now seen corresponding path program 5 times [2024-06-20 19:03:37,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:37,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610495297] [2024-06-20 19:03:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:47,452 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-20 19:03:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:47,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610495297] [2024-06-20 19:03:47,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610495297] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:47,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197093169] [2024-06-20 19:03:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:47,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:47,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:47,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:47,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:47,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:47,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 124 transitions, 1107 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:47,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:47,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:47,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:48,018 INFO L124 PetriNetUnfolderBase]: 347/629 cut-off events. [2024-06-20 19:03:48,019 INFO L125 PetriNetUnfolderBase]: For 35731/35731 co-relation queries the response was YES. [2024-06-20 19:03:48,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 629 events. 347/629 cut-off events. For 35731/35731 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2679 event pairs, 56 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 4451. Up to 445 conditions per place. [2024-06-20 19:03:48,023 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 99 selfloop transitions, 40 changer transitions 0/142 dead transitions. [2024-06-20 19:03:48,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 142 transitions, 1551 flow [2024-06-20 19:03:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-20 19:03:48,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4107744107744108 [2024-06-20 19:03:48,025 INFO L175 Difference]: Start difference. First operand has 143 places, 124 transitions, 1107 flow. Second operand 9 states and 122 transitions. [2024-06-20 19:03:48,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 142 transitions, 1551 flow [2024-06-20 19:03:48,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 142 transitions, 1441 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:48,054 INFO L231 Difference]: Finished difference. Result has 146 places, 126 transitions, 1120 flow [2024-06-20 19:03:48,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1120, PETRI_PLACES=146, PETRI_TRANSITIONS=126} [2024-06-20 19:03:48,057 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 114 predicate places. [2024-06-20 19:03:48,057 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 126 transitions, 1120 flow [2024-06-20 19:03:48,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:48,057 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:48,057 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:48,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:03:48,062 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-20 19:03:48,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:48,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1861340804, now seen corresponding path program 2 times [2024-06-20 19:03:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:48,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159289061] [2024-06-20 19:03:48,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:48,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:59,003 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-20 19:03:59,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159289061] [2024-06-20 19:03:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159289061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:03:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794146110] [2024-06-20 19:03:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:59,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:03:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:03:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:03:59,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:03:59,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 126 transitions, 1120 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:59,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:59,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:03:59,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:59,513 INFO L124 PetriNetUnfolderBase]: 355/642 cut-off events. [2024-06-20 19:03:59,513 INFO L125 PetriNetUnfolderBase]: For 37118/37118 co-relation queries the response was YES. [2024-06-20 19:03:59,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 642 events. 355/642 cut-off events. For 37118/37118 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2753 event pairs, 58 based on Foata normal form. 1/642 useless extension candidates. Maximal degree in co-relation 4552. Up to 525 conditions per place. [2024-06-20 19:03:59,518 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 37 changer transitions 0/141 dead transitions. [2024-06-20 19:03:59,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 141 transitions, 1562 flow [2024-06-20 19:03:59,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:03:59,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:03:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 19:03:59,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39057239057239057 [2024-06-20 19:03:59,519 INFO L175 Difference]: Start difference. First operand has 146 places, 126 transitions, 1120 flow. Second operand 9 states and 116 transitions. [2024-06-20 19:03:59,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 141 transitions, 1562 flow [2024-06-20 19:03:59,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 141 transitions, 1474 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-20 19:03:59,550 INFO L231 Difference]: Finished difference. Result has 149 places, 130 transitions, 1171 flow [2024-06-20 19:03:59,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1171, PETRI_PLACES=149, PETRI_TRANSITIONS=130} [2024-06-20 19:03:59,551 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 117 predicate places. [2024-06-20 19:03:59,551 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 130 transitions, 1171 flow [2024-06-20 19:03:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:03:59,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:59,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:59,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:03:59,552 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-20 19:03:59,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1861101794, now seen corresponding path program 3 times [2024-06-20 19:03:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435600428] [2024-06-20 19:03:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:10,391 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-20 19:04:10,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:10,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435600428] [2024-06-20 19:04:10,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435600428] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:10,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:10,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:10,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911111666] [2024-06-20 19:04:10,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:10,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:10,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:10,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:10,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:10,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:04:10,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 130 transitions, 1171 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:10,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:10,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:04:10,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:10,944 INFO L124 PetriNetUnfolderBase]: 358/647 cut-off events. [2024-06-20 19:04:10,944 INFO L125 PetriNetUnfolderBase]: For 38930/38930 co-relation queries the response was YES. [2024-06-20 19:04:10,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4693 conditions, 647 events. 358/647 cut-off events. For 38930/38930 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2778 event pairs, 58 based on Foata normal form. 1/647 useless extension candidates. Maximal degree in co-relation 4623. Up to 529 conditions per place. [2024-06-20 19:04:10,949 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 96 selfloop transitions, 44 changer transitions 0/143 dead transitions. [2024-06-20 19:04:10,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 143 transitions, 1595 flow [2024-06-20 19:04:10,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:04:10,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-20 19:04:10,952 INFO L175 Difference]: Start difference. First operand has 149 places, 130 transitions, 1171 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:04:10,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 143 transitions, 1595 flow [2024-06-20 19:04:10,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 143 transitions, 1529 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-20 19:04:10,992 INFO L231 Difference]: Finished difference. Result has 153 places, 132 transitions, 1230 flow [2024-06-20 19:04:10,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=153, PETRI_TRANSITIONS=132} [2024-06-20 19:04:10,993 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 121 predicate places. [2024-06-20 19:04:10,993 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 132 transitions, 1230 flow [2024-06-20 19:04:10,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:10,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:10,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:10,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:04:10,994 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-20 19:04:10,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash 44079890, now seen corresponding path program 6 times [2024-06-20 19:04:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874239114] [2024-06-20 19:04:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:21,979 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-20 19:04:21,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874239114] [2024-06-20 19:04:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874239114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:21,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:21,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:21,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059053193] [2024-06-20 19:04:21,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:21,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:21,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:21,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:21,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:22,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:04:22,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 132 transitions, 1230 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:22,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:22,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:04:22,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:22,617 INFO L124 PetriNetUnfolderBase]: 354/641 cut-off events. [2024-06-20 19:04:22,617 INFO L125 PetriNetUnfolderBase]: For 39628/39628 co-relation queries the response was YES. [2024-06-20 19:04:22,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4662 conditions, 641 events. 354/641 cut-off events. For 39628/39628 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2761 event pairs, 51 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 4590. Up to 460 conditions per place. [2024-06-20 19:04:22,621 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 98 selfloop transitions, 45 changer transitions 0/146 dead transitions. [2024-06-20 19:04:22,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 146 transitions, 1556 flow [2024-06-20 19:04:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-20 19:04:22,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39730639730639733 [2024-06-20 19:04:22,622 INFO L175 Difference]: Start difference. First operand has 153 places, 132 transitions, 1230 flow. Second operand 9 states and 118 transitions. [2024-06-20 19:04:22,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 146 transitions, 1556 flow [2024-06-20 19:04:22,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 146 transitions, 1438 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-20 19:04:22,656 INFO L231 Difference]: Finished difference. Result has 156 places, 132 transitions, 1207 flow [2024-06-20 19:04:22,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=156, PETRI_TRANSITIONS=132} [2024-06-20 19:04:22,656 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 124 predicate places. [2024-06-20 19:04:22,657 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 132 transitions, 1207 flow [2024-06-20 19:04:22,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:22,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:22,657 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:22,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:04:22,657 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-20 19:04:22,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:22,658 INFO L85 PathProgramCache]: Analyzing trace with hash 44088818, now seen corresponding path program 1 times [2024-06-20 19:04:22,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:22,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246358656] [2024-06-20 19:04:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:22,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:32,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-20 19:04:32,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:32,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246358656] [2024-06-20 19:04:32,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246358656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:32,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:32,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:32,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238010173] [2024-06-20 19:04:32,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:32,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:32,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:32,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:32,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:32,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:04:32,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 132 transitions, 1207 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:32,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:32,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:04:32,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:32,735 INFO L124 PetriNetUnfolderBase]: 339/630 cut-off events. [2024-06-20 19:04:32,735 INFO L125 PetriNetUnfolderBase]: For 39887/39887 co-relation queries the response was YES. [2024-06-20 19:04:32,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4542 conditions, 630 events. 339/630 cut-off events. For 39887/39887 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2795 event pairs, 56 based on Foata normal form. 1/630 useless extension candidates. Maximal degree in co-relation 4469. Up to 530 conditions per place. [2024-06-20 19:04:32,740 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 102 selfloop transitions, 19 changer transitions 0/145 dead transitions. [2024-06-20 19:04:32,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 145 transitions, 1507 flow [2024-06-20 19:04:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:04:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:04:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:04:32,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2024-06-20 19:04:32,741 INFO L175 Difference]: Start difference. First operand has 156 places, 132 transitions, 1207 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:04:32,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 145 transitions, 1507 flow [2024-06-20 19:04:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 145 transitions, 1397 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-20 19:04:32,778 INFO L231 Difference]: Finished difference. Result has 158 places, 136 transitions, 1187 flow [2024-06-20 19:04:32,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1187, PETRI_PLACES=158, PETRI_TRANSITIONS=136} [2024-06-20 19:04:32,778 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-20 19:04:32,779 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 136 transitions, 1187 flow [2024-06-20 19:04:32,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:32,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:32,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:32,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:04:32,779 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-20 19:04:32,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:32,780 INFO L85 PathProgramCache]: Analyzing trace with hash 44080138, now seen corresponding path program 4 times [2024-06-20 19:04:32,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:32,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908712915] [2024-06-20 19:04:32,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:32,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:43,224 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-20 19:04:43,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:43,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908712915] [2024-06-20 19:04:43,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908712915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:43,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862198672] [2024-06-20 19:04:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:43,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:43,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:04:43,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 136 transitions, 1187 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:43,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:43,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:04:43,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:43,743 INFO L124 PetriNetUnfolderBase]: 358/648 cut-off events. [2024-06-20 19:04:43,743 INFO L125 PetriNetUnfolderBase]: For 40324/40324 co-relation queries the response was YES. [2024-06-20 19:04:43,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 648 events. 358/648 cut-off events. For 40324/40324 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2785 event pairs, 56 based on Foata normal form. 1/648 useless extension candidates. Maximal degree in co-relation 4586. Up to 528 conditions per place. [2024-06-20 19:04:43,748 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 99 selfloop transitions, 44 changer transitions 0/146 dead transitions. [2024-06-20 19:04:43,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 146 transitions, 1497 flow [2024-06-20 19:04:43,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:04:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:04:43,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:04:43,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-20 19:04:43,751 INFO L175 Difference]: Start difference. First operand has 158 places, 136 transitions, 1187 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:04:43,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 146 transitions, 1497 flow [2024-06-20 19:04:43,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 146 transitions, 1391 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-06-20 19:04:43,799 INFO L231 Difference]: Finished difference. Result has 157 places, 136 transitions, 1174 flow [2024-06-20 19:04:43,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1174, PETRI_PLACES=157, PETRI_TRANSITIONS=136} [2024-06-20 19:04:43,799 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2024-06-20 19:04:43,800 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 136 transitions, 1174 flow [2024-06-20 19:04:43,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:43,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:43,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:43,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:04:43,800 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-20 19:04:43,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash -339565968, now seen corresponding path program 7 times [2024-06-20 19:04:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076225473] [2024-06-20 19:04:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:54,941 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-20 19:04:54,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:54,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076225473] [2024-06-20 19:04:54,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076225473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:04:54,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421044201] [2024-06-20 19:04:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:54,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:04:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:54,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:04:54,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:04:55,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:04:55,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 136 transitions, 1174 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:55,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:55,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:04:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:55,452 INFO L124 PetriNetUnfolderBase]: 369/670 cut-off events. [2024-06-20 19:04:55,453 INFO L125 PetriNetUnfolderBase]: For 44447/44447 co-relation queries the response was YES. [2024-06-20 19:04:55,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4858 conditions, 670 events. 369/670 cut-off events. For 44447/44447 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2913 event pairs, 51 based on Foata normal form. 2/671 useless extension candidates. Maximal degree in co-relation 4784. Up to 431 conditions per place. [2024-06-20 19:04:55,458 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 93 selfloop transitions, 60 changer transitions 0/156 dead transitions. [2024-06-20 19:04:55,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 156 transitions, 1686 flow [2024-06-20 19:04:55,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:04:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:04:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 19:04:55,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396969696969697 [2024-06-20 19:04:55,459 INFO L175 Difference]: Start difference. First operand has 157 places, 136 transitions, 1174 flow. Second operand 10 states and 131 transitions. [2024-06-20 19:04:55,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 156 transitions, 1686 flow [2024-06-20 19:04:55,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 156 transitions, 1571 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-20 19:04:55,503 INFO L231 Difference]: Finished difference. Result has 158 places, 140 transitions, 1256 flow [2024-06-20 19:04:55,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1256, PETRI_PLACES=158, PETRI_TRANSITIONS=140} [2024-06-20 19:04:55,504 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 126 predicate places. [2024-06-20 19:04:55,504 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 140 transitions, 1256 flow [2024-06-20 19:04:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:04:55,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:55,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:55,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:04:55,505 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-20 19:04:55,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:55,505 INFO L85 PathProgramCache]: Analyzing trace with hash -339565720, now seen corresponding path program 5 times [2024-06-20 19:04:55,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:55,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484868381] [2024-06-20 19:04:55,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:55,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:05,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-20 19:05:05,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:05,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484868381] [2024-06-20 19:05:05,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484868381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086184934] [2024-06-20 19:05:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:05,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:05,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:06,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:05:06,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 140 transitions, 1256 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:06,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:06,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:05:06,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:06,511 INFO L124 PetriNetUnfolderBase]: 377/685 cut-off events. [2024-06-20 19:05:06,511 INFO L125 PetriNetUnfolderBase]: For 46822/46822 co-relation queries the response was YES. [2024-06-20 19:05:06,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5115 conditions, 685 events. 377/685 cut-off events. For 46822/46822 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3016 event pairs, 57 based on Foata normal form. 1/685 useless extension candidates. Maximal degree in co-relation 5040. Up to 503 conditions per place. [2024-06-20 19:05:06,516 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 94 selfloop transitions, 62 changer transitions 0/159 dead transitions. [2024-06-20 19:05:06,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 159 transitions, 1886 flow [2024-06-20 19:05:06,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:06,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:05:06,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-06-20 19:05:06,519 INFO L175 Difference]: Start difference. First operand has 158 places, 140 transitions, 1256 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:05:06,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 159 transitions, 1886 flow [2024-06-20 19:05:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 1806 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:06,571 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1405 flow [2024-06-20 19:05:06,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1405, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2024-06-20 19:05:06,571 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 130 predicate places. [2024-06-20 19:05:06,572 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1405 flow [2024-06-20 19:05:06,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:06,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:06,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:06,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:05:06,572 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-20 19:05:06,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash -339557350, now seen corresponding path program 6 times [2024-06-20 19:05:06,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775764899] [2024-06-20 19:05:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:06,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:17,139 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-20 19:05:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775764899] [2024-06-20 19:05:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775764899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:17,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:17,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137286767] [2024-06-20 19:05:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:17,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:17,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:17,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:17,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:05:17,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1405 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:17,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:17,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:05:17,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:17,676 INFO L124 PetriNetUnfolderBase]: 380/688 cut-off events. [2024-06-20 19:05:17,677 INFO L125 PetriNetUnfolderBase]: For 48544/48544 co-relation queries the response was YES. [2024-06-20 19:05:17,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5258 conditions, 688 events. 380/688 cut-off events. For 48544/48544 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3013 event pairs, 59 based on Foata normal form. 1/688 useless extension candidates. Maximal degree in co-relation 5181. Up to 507 conditions per place. [2024-06-20 19:05:17,693 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 95 selfloop transitions, 63 changer transitions 0/161 dead transitions. [2024-06-20 19:05:17,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 161 transitions, 1983 flow [2024-06-20 19:05:17,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 19:05:17,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-20 19:05:17,702 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1405 flow. Second operand 10 states and 130 transitions. [2024-06-20 19:05:17,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 161 transitions, 1983 flow [2024-06-20 19:05:17,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 161 transitions, 1887 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-20 19:05:17,754 INFO L231 Difference]: Finished difference. Result has 167 places, 148 transitions, 1476 flow [2024-06-20 19:05:17,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1476, PETRI_PLACES=167, PETRI_TRANSITIONS=148} [2024-06-20 19:05:17,754 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 135 predicate places. [2024-06-20 19:05:17,755 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 148 transitions, 1476 flow [2024-06-20 19:05:17,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:17,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:17,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:17,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:05:17,755 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-20 19:05:17,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:17,756 INFO L85 PathProgramCache]: Analyzing trace with hash -624902988, now seen corresponding path program 8 times [2024-06-20 19:05:17,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:17,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357048770] [2024-06-20 19:05:17,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:17,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:28,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357048770] [2024-06-20 19:05:28,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357048770] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:28,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:28,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:28,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051992012] [2024-06-20 19:05:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:28,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:28,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:28,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:05:28,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 148 transitions, 1476 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:28,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:28,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:05:28,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:29,191 INFO L124 PetriNetUnfolderBase]: 386/700 cut-off events. [2024-06-20 19:05:29,192 INFO L125 PetriNetUnfolderBase]: For 51687/51687 co-relation queries the response was YES. [2024-06-20 19:05:29,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5411 conditions, 700 events. 386/700 cut-off events. For 51687/51687 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3103 event pairs, 57 based on Foata normal form. 2/701 useless extension candidates. Maximal degree in co-relation 5332. Up to 455 conditions per place. [2024-06-20 19:05:29,200 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 108 selfloop transitions, 55 changer transitions 0/166 dead transitions. [2024-06-20 19:05:29,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 166 transitions, 1984 flow [2024-06-20 19:05:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:05:29,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:05:29,213 INFO L175 Difference]: Start difference. First operand has 167 places, 148 transitions, 1476 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:05:29,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 166 transitions, 1984 flow [2024-06-20 19:05:29,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 166 transitions, 1849 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:29,279 INFO L231 Difference]: Finished difference. Result has 170 places, 150 transitions, 1494 flow [2024-06-20 19:05:29,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1494, PETRI_PLACES=170, PETRI_TRANSITIONS=150} [2024-06-20 19:05:29,280 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 138 predicate places. [2024-06-20 19:05:29,280 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 150 transitions, 1494 flow [2024-06-20 19:05:29,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:29,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:29,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:29,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:05:29,281 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-20 19:05:29,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:29,281 INFO L85 PathProgramCache]: Analyzing trace with hash -329437710, now seen corresponding path program 2 times [2024-06-20 19:05:29,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:29,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550758726] [2024-06-20 19:05:29,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:29,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:05:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550758726] [2024-06-20 19:05:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550758726] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:38,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398138455] [2024-06-20 19:05:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:38,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:38,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:05:38,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 150 transitions, 1494 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:38,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:38,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:05:38,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:38,857 INFO L124 PetriNetUnfolderBase]: 374/693 cut-off events. [2024-06-20 19:05:38,858 INFO L125 PetriNetUnfolderBase]: For 53597/53597 co-relation queries the response was YES. [2024-06-20 19:05:38,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5397 conditions, 693 events. 374/693 cut-off events. For 53597/53597 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3140 event pairs, 58 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 5317. Up to 525 conditions per place. [2024-06-20 19:05:38,863 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 98 selfloop transitions, 43 changer transitions 0/169 dead transitions. [2024-06-20 19:05:38,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 169 transitions, 2082 flow [2024-06-20 19:05:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-20 19:05:38,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-20 19:05:38,865 INFO L175 Difference]: Start difference. First operand has 170 places, 150 transitions, 1494 flow. Second operand 10 states and 135 transitions. [2024-06-20 19:05:38,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 169 transitions, 2082 flow [2024-06-20 19:05:38,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 169 transitions, 1924 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-06-20 19:05:38,926 INFO L231 Difference]: Finished difference. Result has 172 places, 156 transitions, 1503 flow [2024-06-20 19:05:38,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1336, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1503, PETRI_PLACES=172, PETRI_TRANSITIONS=156} [2024-06-20 19:05:38,926 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2024-06-20 19:05:38,926 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 156 transitions, 1503 flow [2024-06-20 19:05:38,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:38,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:38,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:38,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:05:38,927 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-20 19:05:38,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1741052770, now seen corresponding path program 3 times [2024-06-20 19:05:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:38,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899632928] [2024-06-20 19:05:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:49,754 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-20 19:05:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899632928] [2024-06-20 19:05:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899632928] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:05:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010506980] [2024-06-20 19:05:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:49,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:05:49,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:49,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:05:49,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:05:49,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:05:49,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 156 transitions, 1503 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:49,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:49,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:05:49,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:50,281 INFO L124 PetriNetUnfolderBase]: 377/698 cut-off events. [2024-06-20 19:05:50,281 INFO L125 PetriNetUnfolderBase]: For 55456/55456 co-relation queries the response was YES. [2024-06-20 19:05:50,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 698 events. 377/698 cut-off events. For 55456/55456 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3171 event pairs, 58 based on Foata normal form. 1/698 useless extension candidates. Maximal degree in co-relation 5263. Up to 529 conditions per place. [2024-06-20 19:05:50,286 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 101 selfloop transitions, 42 changer transitions 0/171 dead transitions. [2024-06-20 19:05:50,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 171 transitions, 2055 flow [2024-06-20 19:05:50,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:05:50,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:05:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:05:50,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-20 19:05:50,289 INFO L175 Difference]: Start difference. First operand has 172 places, 156 transitions, 1503 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:05:50,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 171 transitions, 2055 flow [2024-06-20 19:05:50,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 1993 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-20 19:05:50,355 INFO L231 Difference]: Finished difference. Result has 177 places, 158 transitions, 1558 flow [2024-06-20 19:05:50,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1558, PETRI_PLACES=177, PETRI_TRANSITIONS=158} [2024-06-20 19:05:50,356 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 145 predicate places. [2024-06-20 19:05:50,356 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 158 transitions, 1558 flow [2024-06-20 19:05:50,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:05:50,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:50,356 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:50,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:05:50,357 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-20 19:05:50,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:50,357 INFO L85 PathProgramCache]: Analyzing trace with hash -554397442, now seen corresponding path program 7 times [2024-06-20 19:05:50,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:50,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670468192] [2024-06-20 19:05:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:50,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:00,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-20 19:06:00,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670468192] [2024-06-20 19:06:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670468192] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085123529] [2024-06-20 19:06:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:00,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:00,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:06:00,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 158 transitions, 1558 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:00,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:00,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:06:00,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:01,337 INFO L124 PetriNetUnfolderBase]: 395/715 cut-off events. [2024-06-20 19:06:01,338 INFO L125 PetriNetUnfolderBase]: For 56350/56350 co-relation queries the response was YES. [2024-06-20 19:06:01,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5534 conditions, 715 events. 395/715 cut-off events. For 56350/56350 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3186 event pairs, 59 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 5452. Up to 533 conditions per place. [2024-06-20 19:06:01,343 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 96 selfloop transitions, 71 changer transitions 0/170 dead transitions. [2024-06-20 19:06:01,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 170 transitions, 2026 flow [2024-06-20 19:06:01,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:01,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 19:06:01,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38484848484848483 [2024-06-20 19:06:01,344 INFO L175 Difference]: Start difference. First operand has 177 places, 158 transitions, 1558 flow. Second operand 10 states and 127 transitions. [2024-06-20 19:06:01,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 170 transitions, 2026 flow [2024-06-20 19:06:01,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 170 transitions, 1927 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:01,421 INFO L231 Difference]: Finished difference. Result has 180 places, 158 transitions, 1606 flow [2024-06-20 19:06:01,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1606, PETRI_PLACES=180, PETRI_TRANSITIONS=158} [2024-06-20 19:06:01,421 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 148 predicate places. [2024-06-20 19:06:01,421 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 158 transitions, 1606 flow [2024-06-20 19:06:01,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:01,422 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:01,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:01,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:06:01,422 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-20 19:06:01,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:01,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1982879344, now seen corresponding path program 9 times [2024-06-20 19:06:01,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:01,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784794298] [2024-06-20 19:06:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:01,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:12,355 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-20 19:06:12,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:12,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784794298] [2024-06-20 19:06:12,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784794298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:12,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:12,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:12,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905781512] [2024-06-20 19:06:12,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:12,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:12,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:12,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:12,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:12,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:06:12,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 158 transitions, 1606 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:12,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:12,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:06:12,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:12,917 INFO L124 PetriNetUnfolderBase]: 401/727 cut-off events. [2024-06-20 19:06:12,918 INFO L125 PetriNetUnfolderBase]: For 59980/59980 co-relation queries the response was YES. [2024-06-20 19:06:12,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5669 conditions, 727 events. 401/727 cut-off events. For 59980/59980 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3266 event pairs, 57 based on Foata normal form. 2/728 useless extension candidates. Maximal degree in co-relation 5586. Up to 476 conditions per place. [2024-06-20 19:06:12,924 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 120 selfloop transitions, 54 changer transitions 0/177 dead transitions. [2024-06-20 19:06:12,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 177 transitions, 2142 flow [2024-06-20 19:06:12,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2024-06-20 19:06:12,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-06-20 19:06:12,925 INFO L175 Difference]: Start difference. First operand has 180 places, 158 transitions, 1606 flow. Second operand 10 states and 135 transitions. [2024-06-20 19:06:12,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 177 transitions, 2142 flow [2024-06-20 19:06:13,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 177 transitions, 2013 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:06:13,010 INFO L231 Difference]: Finished difference. Result has 181 places, 160 transitions, 1622 flow [2024-06-20 19:06:13,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1622, PETRI_PLACES=181, PETRI_TRANSITIONS=160} [2024-06-20 19:06:13,010 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 149 predicate places. [2024-06-20 19:06:13,010 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 160 transitions, 1622 flow [2024-06-20 19:06:13,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:13,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:13,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:13,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:06:13,011 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-20 19:06:13,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1982879592, now seen corresponding path program 8 times [2024-06-20 19:06:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:13,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860050971] [2024-06-20 19:06:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:13,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:23,962 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-20 19:06:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860050971] [2024-06-20 19:06:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860050971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929192934] [2024-06-20 19:06:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:23,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:24,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:06:24,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 160 transitions, 1622 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:24,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:24,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:06:24,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:24,533 INFO L124 PetriNetUnfolderBase]: 409/740 cut-off events. [2024-06-20 19:06:24,533 INFO L125 PetriNetUnfolderBase]: For 62551/62551 co-relation queries the response was YES. [2024-06-20 19:06:24,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 740 events. 409/740 cut-off events. For 62551/62551 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3324 event pairs, 59 based on Foata normal form. 1/740 useless extension candidates. Maximal degree in co-relation 5780. Up to 553 conditions per place. [2024-06-20 19:06:24,539 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 114 selfloop transitions, 60 changer transitions 0/177 dead transitions. [2024-06-20 19:06:24,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 177 transitions, 2288 flow [2024-06-20 19:06:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:24,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:06:24,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:06:24,542 INFO L175 Difference]: Start difference. First operand has 181 places, 160 transitions, 1622 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:06:24,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 177 transitions, 2288 flow [2024-06-20 19:06:24,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 177 transitions, 2129 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:24,627 INFO L231 Difference]: Finished difference. Result has 183 places, 164 transitions, 1656 flow [2024-06-20 19:06:24,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1656, PETRI_PLACES=183, PETRI_TRANSITIONS=164} [2024-06-20 19:06:24,627 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 151 predicate places. [2024-06-20 19:06:24,627 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 164 transitions, 1656 flow [2024-06-20 19:06:24,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:24,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:24,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:24,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:06:24,628 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-20 19:06:24,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:24,628 INFO L85 PathProgramCache]: Analyzing trace with hash -329081520, now seen corresponding path program 4 times [2024-06-20 19:06:24,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:24,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72136925] [2024-06-20 19:06:24,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:24,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:35,112 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-20 19:06:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72136925] [2024-06-20 19:06:35,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72136925] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:35,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:35,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:35,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617196896] [2024-06-20 19:06:35,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:35,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:35,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:06:35,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 164 transitions, 1656 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:35,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:35,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:06:35,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:35,734 INFO L124 PetriNetUnfolderBase]: 385/715 cut-off events. [2024-06-20 19:06:35,734 INFO L125 PetriNetUnfolderBase]: For 62741/62741 co-relation queries the response was YES. [2024-06-20 19:06:35,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 715 events. 385/715 cut-off events. For 62741/62741 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3293 event pairs, 65 based on Foata normal form. 1/715 useless extension candidates. Maximal degree in co-relation 5493. Up to 604 conditions per place. [2024-06-20 19:06:35,739 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 127 selfloop transitions, 15 changer transitions 0/172 dead transitions. [2024-06-20 19:06:35,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 172 transitions, 1958 flow [2024-06-20 19:06:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:06:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:06:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:06:35,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838383838383838 [2024-06-20 19:06:35,741 INFO L175 Difference]: Start difference. First operand has 183 places, 164 transitions, 1656 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:06:35,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 172 transitions, 1958 flow [2024-06-20 19:06:35,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 172 transitions, 1746 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:35,825 INFO L231 Difference]: Finished difference. Result has 184 places, 164 transitions, 1479 flow [2024-06-20 19:06:35,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1479, PETRI_PLACES=184, PETRI_TRANSITIONS=164} [2024-06-20 19:06:35,825 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 152 predicate places. [2024-06-20 19:06:35,826 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 164 transitions, 1479 flow [2024-06-20 19:06:35,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:35,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:35,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:35,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:06:35,826 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-20 19:06:35,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash -624896230, now seen corresponding path program 9 times [2024-06-20 19:06:35,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:35,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725807571] [2024-06-20 19:06:35,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:35,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:46,516 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-20 19:06:46,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:46,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725807571] [2024-06-20 19:06:46,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725807571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:46,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:46,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775938987] [2024-06-20 19:06:46,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:46,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:46,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:46,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:06:46,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 164 transitions, 1479 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:46,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:46,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:06:46,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:47,034 INFO L124 PetriNetUnfolderBase]: 405/734 cut-off events. [2024-06-20 19:06:47,034 INFO L125 PetriNetUnfolderBase]: For 63106/63106 co-relation queries the response was YES. [2024-06-20 19:06:47,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 734 events. 405/734 cut-off events. For 63106/63106 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3288 event pairs, 59 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 5443. Up to 548 conditions per place. [2024-06-20 19:06:47,040 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 110 selfloop transitions, 63 changer transitions 0/176 dead transitions. [2024-06-20 19:06:47,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 176 transitions, 1967 flow [2024-06-20 19:06:47,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:47,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:06:47,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-06-20 19:06:47,042 INFO L175 Difference]: Start difference. First operand has 184 places, 164 transitions, 1479 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:06:47,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 176 transitions, 1967 flow [2024-06-20 19:06:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 1914 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-20 19:06:47,124 INFO L231 Difference]: Finished difference. Result has 186 places, 164 transitions, 1557 flow [2024-06-20 19:06:47,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1557, PETRI_PLACES=186, PETRI_TRANSITIONS=164} [2024-06-20 19:06:47,125 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-20 19:06:47,125 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 164 transitions, 1557 flow [2024-06-20 19:06:47,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:47,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:47,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:47,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:06:47,126 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-20 19:06:47,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash -849855900, now seen corresponding path program 10 times [2024-06-20 19:06:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:47,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795902802] [2024-06-20 19:06:47,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:47,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:57,544 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-20 19:06:57,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795902802] [2024-06-20 19:06:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795902802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:06:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725856845] [2024-06-20 19:06:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:57,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:06:57,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:57,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:06:57,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:06:57,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:06:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 164 transitions, 1557 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:57,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:57,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:06:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:58,089 INFO L124 PetriNetUnfolderBase]: 401/728 cut-off events. [2024-06-20 19:06:58,089 INFO L125 PetriNetUnfolderBase]: For 63680/63680 co-relation queries the response was YES. [2024-06-20 19:06:58,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5503 conditions, 728 events. 401/728 cut-off events. For 63680/63680 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3280 event pairs, 56 based on Foata normal form. 2/729 useless extension candidates. Maximal degree in co-relation 5417. Up to 480 conditions per place. [2024-06-20 19:06:58,095 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 122 selfloop transitions, 55 changer transitions 0/180 dead transitions. [2024-06-20 19:06:58,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 180 transitions, 1957 flow [2024-06-20 19:06:58,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:06:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:06:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:06:58,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-20 19:06:58,096 INFO L175 Difference]: Start difference. First operand has 186 places, 164 transitions, 1557 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:06:58,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 180 transitions, 1957 flow [2024-06-20 19:06:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 180 transitions, 1802 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-20 19:06:58,175 INFO L231 Difference]: Finished difference. Result has 187 places, 164 transitions, 1517 flow [2024-06-20 19:06:58,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1517, PETRI_PLACES=187, PETRI_TRANSITIONS=164} [2024-06-20 19:06:58,175 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 155 predicate places. [2024-06-20 19:06:58,175 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 164 transitions, 1517 flow [2024-06-20 19:06:58,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:06:58,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:58,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:06:58,176 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-20 19:06:58,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -849616332, now seen corresponding path program 5 times [2024-06-20 19:06:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:58,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698164847] [2024-06-20 19:06:58,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:58,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:06,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698164847] [2024-06-20 19:07:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698164847] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:06,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637939704] [2024-06-20 19:07:06,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:06,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:06,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:06,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:07:06,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 164 transitions, 1517 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:06,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:06,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:07:06,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:07,151 INFO L124 PetriNetUnfolderBase]: 383/712 cut-off events. [2024-06-20 19:07:07,152 INFO L125 PetriNetUnfolderBase]: For 63830/63830 co-relation queries the response was YES. [2024-06-20 19:07:07,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5370 conditions, 712 events. 383/712 cut-off events. For 63830/63830 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3298 event pairs, 57 based on Foata normal form. 1/712 useless extension candidates. Maximal degree in co-relation 5283. Up to 538 conditions per place. [2024-06-20 19:07:07,159 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 106 selfloop transitions, 42 changer transitions 0/178 dead transitions. [2024-06-20 19:07:07,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 178 transitions, 1987 flow [2024-06-20 19:07:07,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:07,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:07:07,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-20 19:07:07,160 INFO L175 Difference]: Start difference. First operand has 187 places, 164 transitions, 1517 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:07:07,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 178 transitions, 1987 flow [2024-06-20 19:07:07,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 178 transitions, 1858 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:07:07,253 INFO L231 Difference]: Finished difference. Result has 187 places, 166 transitions, 1505 flow [2024-06-20 19:07:07,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1505, PETRI_PLACES=187, PETRI_TRANSITIONS=166} [2024-06-20 19:07:07,254 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 155 predicate places. [2024-06-20 19:07:07,254 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 166 transitions, 1505 flow [2024-06-20 19:07:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:07,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:07,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:07,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:07:07,254 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-20 19:07:07,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:07,255 INFO L85 PathProgramCache]: Analyzing trace with hash -624657220, now seen corresponding path program 10 times [2024-06-20 19:07:07,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:07,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828601780] [2024-06-20 19:07:07,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:07,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828601780] [2024-06-20 19:07:17,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828601780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:17,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:17,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614627533] [2024-06-20 19:07:17,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:17,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:17,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:17,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:17,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:17,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:07:17,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 166 transitions, 1505 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:17,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:17,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:07:17,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:18,190 INFO L124 PetriNetUnfolderBase]: 402/730 cut-off events. [2024-06-20 19:07:18,190 INFO L125 PetriNetUnfolderBase]: For 64390/64390 co-relation queries the response was YES. [2024-06-20 19:07:18,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5451 conditions, 730 events. 402/730 cut-off events. For 64390/64390 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3294 event pairs, 58 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 5363. Up to 545 conditions per place. [2024-06-20 19:07:18,197 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 113 selfloop transitions, 61 changer transitions 0/177 dead transitions. [2024-06-20 19:07:18,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 177 transitions, 1879 flow [2024-06-20 19:07:18,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:07:18,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-06-20 19:07:18,199 INFO L175 Difference]: Start difference. First operand has 187 places, 166 transitions, 1505 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:07:18,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 177 transitions, 1879 flow [2024-06-20 19:07:18,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 177 transitions, 1780 flow, removed 18 selfloop flow, removed 7 redundant places. [2024-06-20 19:07:18,290 INFO L231 Difference]: Finished difference. Result has 190 places, 166 transitions, 1533 flow [2024-06-20 19:07:18,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1533, PETRI_PLACES=190, PETRI_TRANSITIONS=166} [2024-06-20 19:07:18,291 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-20 19:07:18,291 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 166 transitions, 1533 flow [2024-06-20 19:07:18,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:18,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:18,291 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:18,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:07:18,291 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-20 19:07:18,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:18,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1143244720, now seen corresponding path program 6 times [2024-06-20 19:07:18,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:18,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232802510] [2024-06-20 19:07:18,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:18,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:29,286 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-20 19:07:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:29,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232802510] [2024-06-20 19:07:29,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232802510] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:29,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:29,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:07:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122249049] [2024-06-20 19:07:29,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:29,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:07:29,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:29,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:07:29,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:07:29,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:07:29,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 166 transitions, 1533 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:29,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:29,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:07:29,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:29,777 INFO L124 PetriNetUnfolderBase]: 379/706 cut-off events. [2024-06-20 19:07:29,778 INFO L125 PetriNetUnfolderBase]: For 64317/64317 co-relation queries the response was YES. [2024-06-20 19:07:29,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5242 conditions, 706 events. 379/706 cut-off events. For 64317/64317 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3275 event pairs, 57 based on Foata normal form. 1/706 useless extension candidates. Maximal degree in co-relation 5153. Up to 588 conditions per place. [2024-06-20 19:07:29,784 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 129 selfloop transitions, 19 changer transitions 0/178 dead transitions. [2024-06-20 19:07:29,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 178 transitions, 1859 flow [2024-06-20 19:07:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-20 19:07:29,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-06-20 19:07:29,785 INFO L175 Difference]: Start difference. First operand has 190 places, 166 transitions, 1533 flow. Second operand 10 states and 129 transitions. [2024-06-20 19:07:29,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 178 transitions, 1859 flow [2024-06-20 19:07:29,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 178 transitions, 1691 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:07:29,875 INFO L231 Difference]: Finished difference. Result has 190 places, 166 transitions, 1408 flow [2024-06-20 19:07:29,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1408, PETRI_PLACES=190, PETRI_TRANSITIONS=166} [2024-06-20 19:07:29,875 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-20 19:07:29,875 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 166 transitions, 1408 flow [2024-06-20 19:07:29,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:29,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:29,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:29,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:07:29,876 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-20 19:07:29,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:29,876 INFO L85 PathProgramCache]: Analyzing trace with hash -329068624, now seen corresponding path program 1 times [2024-06-20 19:07:29,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:29,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730708396] [2024-06-20 19:07:29,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:29,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:41,677 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-20 19:07:41,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:41,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730708396] [2024-06-20 19:07:41,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730708396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:41,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:41,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:07:41,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265440641] [2024-06-20 19:07:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:07:41,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:41,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:07:41,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:07:41,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:07:41,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 166 transitions, 1408 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:41,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:41,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:07:41,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:42,198 INFO L124 PetriNetUnfolderBase]: 374/699 cut-off events. [2024-06-20 19:07:42,199 INFO L125 PetriNetUnfolderBase]: For 64475/64475 co-relation queries the response was YES. [2024-06-20 19:07:42,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 699 events. 374/699 cut-off events. For 64475/64475 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3234 event pairs, 64 based on Foata normal form. 2/700 useless extension candidates. Maximal degree in co-relation 4915. Up to 585 conditions per place. [2024-06-20 19:07:42,204 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 130 selfloop transitions, 16 changer transitions 0/176 dead transitions. [2024-06-20 19:07:42,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 176 transitions, 1722 flow [2024-06-20 19:07:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:07:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:07:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 19:07:42,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37575757575757573 [2024-06-20 19:07:42,205 INFO L175 Difference]: Start difference. First operand has 190 places, 166 transitions, 1408 flow. Second operand 10 states and 124 transitions. [2024-06-20 19:07:42,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 176 transitions, 1722 flow [2024-06-20 19:07:42,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 176 transitions, 1577 flow, removed 9 selfloop flow, removed 14 redundant places. [2024-06-20 19:07:42,288 INFO L231 Difference]: Finished difference. Result has 186 places, 166 transitions, 1299 flow [2024-06-20 19:07:42,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1299, PETRI_PLACES=186, PETRI_TRANSITIONS=166} [2024-06-20 19:07:42,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 154 predicate places. [2024-06-20 19:07:42,290 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 166 transitions, 1299 flow [2024-06-20 19:07:42,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:42,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:42,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:07:42,290 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-20 19:07:42,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 159290972, now seen corresponding path program 1 times [2024-06-20 19:07:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531406488] [2024-06-20 19:07:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:42,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:53,029 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-20 19:07:53,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:53,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531406488] [2024-06-20 19:07:53,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531406488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:53,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:53,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:07:53,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153299339] [2024-06-20 19:07:53,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:53,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:07:53,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:07:53,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:07:53,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-20 19:07:53,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 166 transitions, 1299 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:53,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:53,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-20 19:07:53,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:53,642 INFO L124 PetriNetUnfolderBase]: 395/719 cut-off events. [2024-06-20 19:07:53,642 INFO L125 PetriNetUnfolderBase]: For 62556/62556 co-relation queries the response was YES. [2024-06-20 19:07:53,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 719 events. 395/719 cut-off events. For 62556/62556 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3232 event pairs, 54 based on Foata normal form. 1/719 useless extension candidates. Maximal degree in co-relation 4987. Up to 625 conditions per place. [2024-06-20 19:07:53,648 INFO L140 encePairwiseOnDemand]: 23/33 looper letters, 159 selfloop transitions, 24 changer transitions 0/187 dead transitions. [2024-06-20 19:07:53,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 187 transitions, 1751 flow [2024-06-20 19:07:53,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:07:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:07:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-20 19:07:53,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46464646464646464 [2024-06-20 19:07:53,650 INFO L175 Difference]: Start difference. First operand has 186 places, 166 transitions, 1299 flow. Second operand 9 states and 138 transitions. [2024-06-20 19:07:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 187 transitions, 1751 flow [2024-06-20 19:07:53,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 187 transitions, 1711 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:07:53,741 INFO L231 Difference]: Finished difference. Result has 187 places, 168 transitions, 1350 flow [2024-06-20 19:07:53,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1350, PETRI_PLACES=187, PETRI_TRANSITIONS=168} [2024-06-20 19:07:53,742 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 155 predicate places. [2024-06-20 19:07:53,742 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 168 transitions, 1350 flow [2024-06-20 19:07:53,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:07:53,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:53,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:53,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:07:53,743 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-20 19:07:53,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:53,743 INFO L85 PathProgramCache]: Analyzing trace with hash 163015839, now seen corresponding path program 1 times [2024-06-20 19:07:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314761340] [2024-06-20 19:07:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:04,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:04,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314761340] [2024-06-20 19:08:04,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314761340] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:04,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:04,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:04,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056731749] [2024-06-20 19:08:04,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:04,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:04,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:04,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:04,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:04,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:08:04,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 168 transitions, 1350 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:04,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:04,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:08:04,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:05,015 INFO L124 PetriNetUnfolderBase]: 401/729 cut-off events. [2024-06-20 19:08:05,015 INFO L125 PetriNetUnfolderBase]: For 66557/66557 co-relation queries the response was YES. [2024-06-20 19:08:05,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5197 conditions, 729 events. 401/729 cut-off events. For 66557/66557 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3297 event pairs, 51 based on Foata normal form. 2/730 useless extension candidates. Maximal degree in co-relation 5108. Up to 628 conditions per place. [2024-06-20 19:08:05,021 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 161 selfloop transitions, 25 changer transitions 0/189 dead transitions. [2024-06-20 19:08:05,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 189 transitions, 1806 flow [2024-06-20 19:08:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:08:05,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-20 19:08:05,022 INFO L175 Difference]: Start difference. First operand has 187 places, 168 transitions, 1350 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:08:05,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 189 transitions, 1806 flow [2024-06-20 19:08:05,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 189 transitions, 1731 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:05,108 INFO L231 Difference]: Finished difference. Result has 190 places, 170 transitions, 1364 flow [2024-06-20 19:08:05,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1275, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1364, PETRI_PLACES=190, PETRI_TRANSITIONS=170} [2024-06-20 19:08:05,109 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 158 predicate places. [2024-06-20 19:08:05,109 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 170 transitions, 1364 flow [2024-06-20 19:08:05,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:05,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:05,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:05,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:08:05,110 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-20 19:08:05,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash 307108179, now seen corresponding path program 2 times [2024-06-20 19:08:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200425243] [2024-06-20 19:08:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:17,170 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-20 19:08:17,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:17,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200425243] [2024-06-20 19:08:17,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200425243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:17,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:17,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128035430] [2024-06-20 19:08:17,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:17,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:17,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:17,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:17,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:17,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:08:17,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 170 transitions, 1364 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:17,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:17,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:08:17,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:17,815 INFO L124 PetriNetUnfolderBase]: 427/773 cut-off events. [2024-06-20 19:08:17,815 INFO L125 PetriNetUnfolderBase]: For 77420/77420 co-relation queries the response was YES. [2024-06-20 19:08:17,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5752 conditions, 773 events. 427/773 cut-off events. For 77420/77420 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3524 event pairs, 50 based on Foata normal form. 2/774 useless extension candidates. Maximal degree in co-relation 5661. Up to 599 conditions per place. [2024-06-20 19:08:17,822 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 156 selfloop transitions, 37 changer transitions 0/196 dead transitions. [2024-06-20 19:08:17,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 2168 flow [2024-06-20 19:08:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:17,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:17,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:08:17,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-20 19:08:17,823 INFO L175 Difference]: Start difference. First operand has 190 places, 170 transitions, 1364 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:08:17,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 2168 flow [2024-06-20 19:08:17,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 196 transitions, 2095 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-20 19:08:17,929 INFO L231 Difference]: Finished difference. Result has 192 places, 176 transitions, 1476 flow [2024-06-20 19:08:17,929 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1476, PETRI_PLACES=192, PETRI_TRANSITIONS=176} [2024-06-20 19:08:17,929 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 160 predicate places. [2024-06-20 19:08:17,929 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 176 transitions, 1476 flow [2024-06-20 19:08:17,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:17,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:17,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:17,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:08:17,930 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-20 19:08:17,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:17,930 INFO L85 PathProgramCache]: Analyzing trace with hash 307115619, now seen corresponding path program 3 times [2024-06-20 19:08:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671843285] [2024-06-20 19:08:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:17,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:08:27,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:27,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671843285] [2024-06-20 19:08:27,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671843285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:27,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:27,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42634573] [2024-06-20 19:08:27,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:27,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:27,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:27,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:27,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:27,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:08:27,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 176 transitions, 1476 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:27,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:27,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:08:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:28,324 INFO L124 PetriNetUnfolderBase]: 495/895 cut-off events. [2024-06-20 19:08:28,324 INFO L125 PetriNetUnfolderBase]: For 85048/85048 co-relation queries the response was YES. [2024-06-20 19:08:28,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6527 conditions, 895 events. 495/895 cut-off events. For 85048/85048 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4267 event pairs, 90 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 6435. Up to 756 conditions per place. [2024-06-20 19:08:28,331 INFO L140 encePairwiseOnDemand]: 20/33 looper letters, 180 selfloop transitions, 33 changer transitions 0/216 dead transitions. [2024-06-20 19:08:28,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 216 transitions, 2328 flow [2024-06-20 19:08:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:08:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:08:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2024-06-20 19:08:28,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.371900826446281 [2024-06-20 19:08:28,333 INFO L175 Difference]: Start difference. First operand has 192 places, 176 transitions, 1476 flow. Second operand 11 states and 135 transitions. [2024-06-20 19:08:28,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 216 transitions, 2328 flow [2024-06-20 19:08:28,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 216 transitions, 2217 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-20 19:08:28,456 INFO L231 Difference]: Finished difference. Result has 202 places, 199 transitions, 1753 flow [2024-06-20 19:08:28,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1753, PETRI_PLACES=202, PETRI_TRANSITIONS=199} [2024-06-20 19:08:28,457 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 170 predicate places. [2024-06-20 19:08:28,457 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 199 transitions, 1753 flow [2024-06-20 19:08:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:28,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:28,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:28,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:08:28,458 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-20 19:08:28,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 307115898, now seen corresponding path program 1 times [2024-06-20 19:08:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011819164] [2024-06-20 19:08:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:39,603 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-20 19:08:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011819164] [2024-06-20 19:08:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011819164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:39,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:39,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:39,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226924878] [2024-06-20 19:08:39,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:39,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:39,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:39,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:08:39,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 199 transitions, 1753 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:39,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:39,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:08:39,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:40,235 INFO L124 PetriNetUnfolderBase]: 498/900 cut-off events. [2024-06-20 19:08:40,236 INFO L125 PetriNetUnfolderBase]: For 85354/85354 co-relation queries the response was YES. [2024-06-20 19:08:40,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6701 conditions, 900 events. 498/900 cut-off events. For 85354/85354 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4297 event pairs, 86 based on Foata normal form. 1/900 useless extension candidates. Maximal degree in co-relation 6603. Up to 797 conditions per place. [2024-06-20 19:08:40,244 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 179 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2024-06-20 19:08:40,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 214 transitions, 2237 flow [2024-06-20 19:08:40,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:40,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:08:40,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3696969696969697 [2024-06-20 19:08:40,245 INFO L175 Difference]: Start difference. First operand has 202 places, 199 transitions, 1753 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:08:40,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 214 transitions, 2237 flow [2024-06-20 19:08:40,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 214 transitions, 2167 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:08:40,432 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 1787 flow [2024-06-20 19:08:40,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1683, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1787, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2024-06-20 19:08:40,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2024-06-20 19:08:40,433 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 1787 flow [2024-06-20 19:08:40,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:40,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:40,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:40,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:08:40,433 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-20 19:08:40,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:40,435 INFO L85 PathProgramCache]: Analyzing trace with hash 306906369, now seen corresponding path program 4 times [2024-06-20 19:08:40,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000061968] [2024-06-20 19:08:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:40,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:51,892 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-20 19:08:51,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:51,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000061968] [2024-06-20 19:08:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000061968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:51,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:51,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:08:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747279498] [2024-06-20 19:08:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:51,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:08:51,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:51,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:08:51,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:08:52,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:08:52,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 1787 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:52,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:52,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:08:52,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:52,524 INFO L124 PetriNetUnfolderBase]: 490/890 cut-off events. [2024-06-20 19:08:52,524 INFO L125 PetriNetUnfolderBase]: For 85092/85092 co-relation queries the response was YES. [2024-06-20 19:08:52,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6404 conditions, 890 events. 490/890 cut-off events. For 85092/85092 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4267 event pairs, 61 based on Foata normal form. 4/893 useless extension candidates. Maximal degree in co-relation 6307. Up to 640 conditions per place. [2024-06-20 19:08:52,533 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 55 changer transitions 0/220 dead transitions. [2024-06-20 19:08:52,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 2411 flow [2024-06-20 19:08:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:08:52,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:08:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-20 19:08:52,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403030303030303 [2024-06-20 19:08:52,535 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 1787 flow. Second operand 10 states and 133 transitions. [2024-06-20 19:08:52,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 2411 flow [2024-06-20 19:08:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 220 transitions, 2291 flow, removed 30 selfloop flow, removed 8 redundant places. [2024-06-20 19:08:52,673 INFO L231 Difference]: Finished difference. Result has 207 places, 201 transitions, 1785 flow [2024-06-20 19:08:52,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1785, PETRI_PLACES=207, PETRI_TRANSITIONS=201} [2024-06-20 19:08:52,674 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 175 predicate places. [2024-06-20 19:08:52,674 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 201 transitions, 1785 flow [2024-06-20 19:08:52,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:52,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:52,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:52,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:08:52,675 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-20 19:08:52,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:52,675 INFO L85 PathProgramCache]: Analyzing trace with hash 426341987, now seen corresponding path program 5 times [2024-06-20 19:08:52,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:52,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142354775] [2024-06-20 19:08:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:04,017 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-20 19:09:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142354775] [2024-06-20 19:09:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142354775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120875456] [2024-06-20 19:09:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:04,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:04,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:04,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:04,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:09:04,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 201 transitions, 1785 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:04,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:04,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:09:04,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:04,621 INFO L124 PetriNetUnfolderBase]: 516/932 cut-off events. [2024-06-20 19:09:04,621 INFO L125 PetriNetUnfolderBase]: For 92847/92847 co-relation queries the response was YES. [2024-06-20 19:09:04,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7016 conditions, 932 events. 516/932 cut-off events. For 92847/92847 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4526 event pairs, 54 based on Foata normal form. 2/933 useless extension candidates. Maximal degree in co-relation 6918. Up to 573 conditions per place. [2024-06-20 19:09:04,629 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 145 selfloop transitions, 77 changer transitions 0/225 dead transitions. [2024-06-20 19:09:04,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 225 transitions, 2669 flow [2024-06-20 19:09:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:04,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 134 transitions. [2024-06-20 19:09:04,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40606060606060607 [2024-06-20 19:09:04,630 INFO L175 Difference]: Start difference. First operand has 207 places, 201 transitions, 1785 flow. Second operand 10 states and 134 transitions. [2024-06-20 19:09:04,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 225 transitions, 2669 flow [2024-06-20 19:09:04,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 225 transitions, 2521 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:04,789 INFO L231 Difference]: Finished difference. Result has 208 places, 207 transitions, 1914 flow [2024-06-20 19:09:04,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1914, PETRI_PLACES=208, PETRI_TRANSITIONS=207} [2024-06-20 19:09:04,790 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 176 predicate places. [2024-06-20 19:09:04,790 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 207 transitions, 1914 flow [2024-06-20 19:09:04,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:04,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:04,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:04,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:09:04,791 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-20 19:09:04,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:04,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1366485032, now seen corresponding path program 2 times [2024-06-20 19:09:04,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:04,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926777727] [2024-06-20 19:09:04,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:04,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:15,436 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-20 19:09:15,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:15,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926777727] [2024-06-20 19:09:15,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926777727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:15,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:15,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:15,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841949974] [2024-06-20 19:09:15,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:15,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:15,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:15,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:15,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:09:15,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 207 transitions, 1914 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:15,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:15,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:09:15,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:16,134 INFO L124 PetriNetUnfolderBase]: 529/955 cut-off events. [2024-06-20 19:09:16,134 INFO L125 PetriNetUnfolderBase]: For 98600/98600 co-relation queries the response was YES. [2024-06-20 19:09:16,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7401 conditions, 955 events. 529/955 cut-off events. For 98600/98600 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4678 event pairs, 81 based on Foata normal form. 1/955 useless extension candidates. Maximal degree in co-relation 7302. Up to 782 conditions per place. [2024-06-20 19:09:16,141 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 171 selfloop transitions, 52 changer transitions 0/226 dead transitions. [2024-06-20 19:09:16,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 226 transitions, 2772 flow [2024-06-20 19:09:16,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:09:16,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-20 19:09:16,144 INFO L175 Difference]: Start difference. First operand has 208 places, 207 transitions, 1914 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:09:16,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 226 transitions, 2772 flow [2024-06-20 19:09:16,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 226 transitions, 2676 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-20 19:09:16,291 INFO L231 Difference]: Finished difference. Result has 213 places, 213 transitions, 2033 flow [2024-06-20 19:09:16,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2033, PETRI_PLACES=213, PETRI_TRANSITIONS=213} [2024-06-20 19:09:16,292 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 181 predicate places. [2024-06-20 19:09:16,292 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 213 transitions, 2033 flow [2024-06-20 19:09:16,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:16,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:16,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:16,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:09:16,292 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-20 19:09:16,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:16,293 INFO L85 PathProgramCache]: Analyzing trace with hash 419199866, now seen corresponding path program 3 times [2024-06-20 19:09:16,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:16,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323175473] [2024-06-20 19:09:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:27,060 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-20 19:09:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323175473] [2024-06-20 19:09:27,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323175473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:27,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:27,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:27,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283652144] [2024-06-20 19:09:27,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:27,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:27,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:27,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:27,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:27,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:09:27,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 213 transitions, 2033 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:27,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:27,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:09:27,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:27,659 INFO L124 PetriNetUnfolderBase]: 527/952 cut-off events. [2024-06-20 19:09:27,659 INFO L125 PetriNetUnfolderBase]: For 98526/98526 co-relation queries the response was YES. [2024-06-20 19:09:27,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7368 conditions, 952 events. 527/952 cut-off events. For 98526/98526 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4654 event pairs, 81 based on Foata normal form. 1/952 useless extension candidates. Maximal degree in co-relation 7267. Up to 780 conditions per place. [2024-06-20 19:09:27,668 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 173 selfloop transitions, 49 changer transitions 0/225 dead transitions. [2024-06-20 19:09:27,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 225 transitions, 2647 flow [2024-06-20 19:09:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:27,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:09:27,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-20 19:09:27,670 INFO L175 Difference]: Start difference. First operand has 213 places, 213 transitions, 2033 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:09:27,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 225 transitions, 2647 flow [2024-06-20 19:09:27,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 2562 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-20 19:09:27,840 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 2051 flow [2024-06-20 19:09:27,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1948, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2051, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-06-20 19:09:27,840 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 186 predicate places. [2024-06-20 19:09:27,841 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 2051 flow [2024-06-20 19:09:27,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:27,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:27,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:27,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:09:27,841 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-20 19:09:27,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:27,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1366484753, now seen corresponding path program 6 times [2024-06-20 19:09:27,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:27,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648016762] [2024-06-20 19:09:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:38,021 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-20 19:09:38,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:38,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648016762] [2024-06-20 19:09:38,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648016762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:38,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:38,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:38,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563226704] [2024-06-20 19:09:38,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:38,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:38,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:38,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:38,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:38,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:09:38,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 2051 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:38,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:38,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:09:38,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:38,663 INFO L124 PetriNetUnfolderBase]: 533/962 cut-off events. [2024-06-20 19:09:38,664 INFO L125 PetriNetUnfolderBase]: For 103713/103713 co-relation queries the response was YES. [2024-06-20 19:09:38,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7507 conditions, 962 events. 533/962 cut-off events. For 103713/103713 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4718 event pairs, 54 based on Foata normal form. 2/963 useless extension candidates. Maximal degree in co-relation 7404. Up to 597 conditions per place. [2024-06-20 19:09:38,673 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 153 selfloop transitions, 78 changer transitions 0/234 dead transitions. [2024-06-20 19:09:38,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 234 transitions, 2889 flow [2024-06-20 19:09:38,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:38,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 136 transitions. [2024-06-20 19:09:38,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2024-06-20 19:09:38,674 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 2051 flow. Second operand 10 states and 136 transitions. [2024-06-20 19:09:38,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 234 transitions, 2889 flow [2024-06-20 19:09:38,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 234 transitions, 2754 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-20 19:09:38,852 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 2111 flow [2024-06-20 19:09:38,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2111, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-06-20 19:09:38,868 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 187 predicate places. [2024-06-20 19:09:38,868 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 2111 flow [2024-06-20 19:09:38,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:38,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:38,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:38,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:09:38,869 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-20 19:09:38,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:38,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1366753802, now seen corresponding path program 4 times [2024-06-20 19:09:38,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969521600] [2024-06-20 19:09:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:49,571 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-20 19:09:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969521600] [2024-06-20 19:09:49,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969521600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:49,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:49,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:09:49,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802347204] [2024-06-20 19:09:49,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:09:49,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:49,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:09:49,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:09:49,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:09:49,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 2111 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:49,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:49,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:09:49,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:50,174 INFO L124 PetriNetUnfolderBase]: 536/967 cut-off events. [2024-06-20 19:09:50,174 INFO L125 PetriNetUnfolderBase]: For 104438/104438 co-relation queries the response was YES. [2024-06-20 19:09:50,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7664 conditions, 967 events. 536/967 cut-off events. For 104438/104438 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4759 event pairs, 81 based on Foata normal form. 1/967 useless extension candidates. Maximal degree in co-relation 7560. Up to 794 conditions per place. [2024-06-20 19:09:50,182 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 165 selfloop transitions, 61 changer transitions 0/229 dead transitions. [2024-06-20 19:09:50,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 2771 flow [2024-06-20 19:09:50,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:09:50,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:09:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:09:50,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-20 19:09:50,184 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 2111 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:09:50,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 2771 flow [2024-06-20 19:09:50,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 229 transitions, 2649 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-20 19:09:50,369 INFO L231 Difference]: Finished difference. Result has 223 places, 217 transitions, 2151 flow [2024-06-20 19:09:50,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1989, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2151, PETRI_PLACES=223, PETRI_TRANSITIONS=217} [2024-06-20 19:09:50,370 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 191 predicate places. [2024-06-20 19:09:50,370 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 217 transitions, 2151 flow [2024-06-20 19:09:50,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:09:50,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:50,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:50,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:09:50,371 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-20 19:09:50,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1359334913, now seen corresponding path program 7 times [2024-06-20 19:09:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:50,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653318147] [2024-06-20 19:09:50,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:50,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:00,570 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-20 19:10:00,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:00,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653318147] [2024-06-20 19:10:00,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653318147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:00,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:00,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:00,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343111750] [2024-06-20 19:10:00,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:00,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:00,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:00,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:00,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:00,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:10:00,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 217 transitions, 2151 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:00,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:00,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:10:00,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:01,326 INFO L124 PetriNetUnfolderBase]: 542/981 cut-off events. [2024-06-20 19:10:01,326 INFO L125 PetriNetUnfolderBase]: For 109986/109986 co-relation queries the response was YES. [2024-06-20 19:10:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7721 conditions, 981 events. 542/981 cut-off events. For 109986/109986 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4870 event pairs, 72 based on Foata normal form. 2/982 useless extension candidates. Maximal degree in co-relation 7616. Up to 608 conditions per place. [2024-06-20 19:10:01,335 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 162 selfloop transitions, 74 changer transitions 0/239 dead transitions. [2024-06-20 19:10:01,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 239 transitions, 3167 flow [2024-06-20 19:10:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:01,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-20 19:10:01,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-20 19:10:01,336 INFO L175 Difference]: Start difference. First operand has 223 places, 217 transitions, 2151 flow. Second operand 10 states and 138 transitions. [2024-06-20 19:10:01,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 239 transitions, 3167 flow [2024-06-20 19:10:01,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 239 transitions, 3038 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-20 19:10:01,518 INFO L231 Difference]: Finished difference. Result has 226 places, 219 transitions, 2219 flow [2024-06-20 19:10:01,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2022, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2219, PETRI_PLACES=226, PETRI_TRANSITIONS=219} [2024-06-20 19:10:01,519 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 194 predicate places. [2024-06-20 19:10:01,519 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 219 transitions, 2219 flow [2024-06-20 19:10:01,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:01,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:01,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:01,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:10:01,519 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-20 19:10:01,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1859580291, now seen corresponding path program 8 times [2024-06-20 19:10:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412104703] [2024-06-20 19:10:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:01,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:12,554 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-20 19:10:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412104703] [2024-06-20 19:10:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412104703] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:12,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167714430] [2024-06-20 19:10:12,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:12,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:12,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:12,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:12,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:10:12,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 219 transitions, 2219 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:12,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:12,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:10:12,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:13,198 INFO L124 PetriNetUnfolderBase]: 538/973 cut-off events. [2024-06-20 19:10:13,198 INFO L125 PetriNetUnfolderBase]: For 107653/107653 co-relation queries the response was YES. [2024-06-20 19:10:13,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7629 conditions, 973 events. 538/973 cut-off events. For 107653/107653 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 4830 event pairs, 49 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 7523. Up to 605 conditions per place. [2024-06-20 19:10:13,207 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 142 selfloop transitions, 91 changer transitions 0/236 dead transitions. [2024-06-20 19:10:13,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 236 transitions, 2883 flow [2024-06-20 19:10:13,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:10:13,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:10:13,208 INFO L175 Difference]: Start difference. First operand has 226 places, 219 transitions, 2219 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:10:13,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 236 transitions, 2883 flow [2024-06-20 19:10:13,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 236 transitions, 2547 flow, removed 33 selfloop flow, removed 10 redundant places. [2024-06-20 19:10:13,401 INFO L231 Difference]: Finished difference. Result has 226 places, 219 transitions, 2070 flow [2024-06-20 19:10:13,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2070, PETRI_PLACES=226, PETRI_TRANSITIONS=219} [2024-06-20 19:10:13,401 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 194 predicate places. [2024-06-20 19:10:13,402 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 219 transitions, 2070 flow [2024-06-20 19:10:13,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:13,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:13,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:13,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:10:13,402 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-20 19:10:13,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:13,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1366754143, now seen corresponding path program 1 times [2024-06-20 19:10:13,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:13,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687053927] [2024-06-20 19:10:13,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:13,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:24,878 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-20 19:10:24,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:24,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687053927] [2024-06-20 19:10:24,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687053927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:24,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:24,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405947347] [2024-06-20 19:10:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:24,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:24,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:24,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:24,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:25,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-20 19:10:25,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 219 transitions, 2070 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:25,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:25,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-20 19:10:25,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:25,525 INFO L124 PetriNetUnfolderBase]: 516/952 cut-off events. [2024-06-20 19:10:25,525 INFO L125 PetriNetUnfolderBase]: For 106542/106542 co-relation queries the response was YES. [2024-06-20 19:10:25,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7329 conditions, 952 events. 516/952 cut-off events. For 106542/106542 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4825 event pairs, 91 based on Foata normal form. 1/949 useless extension candidates. Maximal degree in co-relation 7223. Up to 784 conditions per place. [2024-06-20 19:10:25,534 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 168 selfloop transitions, 28 changer transitions 0/232 dead transitions. [2024-06-20 19:10:25,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 2512 flow [2024-06-20 19:10:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:10:25,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2024-06-20 19:10:25,535 INFO L175 Difference]: Start difference. First operand has 226 places, 219 transitions, 2070 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:10:25,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 2512 flow [2024-06-20 19:10:25,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 2357 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:10:25,704 INFO L231 Difference]: Finished difference. Result has 227 places, 221 transitions, 2005 flow [2024-06-20 19:10:25,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1915, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2005, PETRI_PLACES=227, PETRI_TRANSITIONS=221} [2024-06-20 19:10:25,704 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 195 predicate places. [2024-06-20 19:10:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 221 transitions, 2005 flow [2024-06-20 19:10:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:25,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:25,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:25,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:10:25,705 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-20 19:10:25,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1366744502, now seen corresponding path program 5 times [2024-06-20 19:10:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:25,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063030939] [2024-06-20 19:10:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:25,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:36,197 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-20 19:10:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:36,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063030939] [2024-06-20 19:10:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063030939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549911084] [2024-06-20 19:10:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:36,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:36,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:36,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:36,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:10:36,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 221 transitions, 2005 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:36,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:36,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:10:36,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:36,816 INFO L124 PetriNetUnfolderBase]: 539/975 cut-off events. [2024-06-20 19:10:36,816 INFO L125 PetriNetUnfolderBase]: For 105617/105617 co-relation queries the response was YES. [2024-06-20 19:10:36,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7333 conditions, 975 events. 539/975 cut-off events. For 105617/105617 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 4814 event pairs, 81 based on Foata normal form. 1/975 useless extension candidates. Maximal degree in co-relation 7226. Up to 801 conditions per place. [2024-06-20 19:10:36,825 INFO L140 encePairwiseOnDemand]: 22/33 looper letters, 172 selfloop transitions, 57 changer transitions 0/232 dead transitions. [2024-06-20 19:10:36,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 232 transitions, 2489 flow [2024-06-20 19:10:36,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-20 19:10:36,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-20 19:10:36,827 INFO L175 Difference]: Start difference. First operand has 227 places, 221 transitions, 2005 flow. Second operand 10 states and 125 transitions. [2024-06-20 19:10:36,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 232 transitions, 2489 flow [2024-06-20 19:10:37,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 232 transitions, 2395 flow, removed 21 selfloop flow, removed 8 redundant places. [2024-06-20 19:10:37,017 INFO L231 Difference]: Finished difference. Result has 229 places, 221 transitions, 2030 flow [2024-06-20 19:10:37,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2030, PETRI_PLACES=229, PETRI_TRANSITIONS=221} [2024-06-20 19:10:37,020 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 197 predicate places. [2024-06-20 19:10:37,020 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 221 transitions, 2030 flow [2024-06-20 19:10:37,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:37,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:37,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:37,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:10:37,021 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-20 19:10:37,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1359327473, now seen corresponding path program 9 times [2024-06-20 19:10:37,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:37,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362750395] [2024-06-20 19:10:37,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:37,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:48,586 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-20 19:10:48,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:48,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362750395] [2024-06-20 19:10:48,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362750395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:48,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:48,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:10:48,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102672873] [2024-06-20 19:10:48,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:10:48,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:10:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:10:48,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-20 19:10:48,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 221 transitions, 2030 flow. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:48,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:48,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-20 19:10:48,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:49,273 INFO L124 PetriNetUnfolderBase]: 545/987 cut-off events. [2024-06-20 19:10:49,274 INFO L125 PetriNetUnfolderBase]: For 111415/111415 co-relation queries the response was YES. [2024-06-20 19:10:49,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 987 events. 545/987 cut-off events. For 111415/111415 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 4911 event pairs, 70 based on Foata normal form. 2/988 useless extension candidates. Maximal degree in co-relation 7352. Up to 613 conditions per place. [2024-06-20 19:10:49,283 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 164 selfloop transitions, 75 changer transitions 0/242 dead transitions. [2024-06-20 19:10:49,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 242 transitions, 2910 flow [2024-06-20 19:10:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:10:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:10:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2024-06-20 19:10:49,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41818181818181815 [2024-06-20 19:10:49,286 INFO L175 Difference]: Start difference. First operand has 229 places, 221 transitions, 2030 flow. Second operand 10 states and 138 transitions. [2024-06-20 19:10:49,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 242 transitions, 2910 flow [2024-06-20 19:10:49,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 242 transitions, 2767 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-20 19:10:49,470 INFO L231 Difference]: Finished difference. Result has 229 places, 223 transitions, 2078 flow [2024-06-20 19:10:49,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2078, PETRI_PLACES=229, PETRI_TRANSITIONS=223} [2024-06-20 19:10:49,470 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 197 predicate places. [2024-06-20 19:10:49,470 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 223 transitions, 2078 flow [2024-06-20 19:10:49,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:10:49,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:49,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:49,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:10:49,471 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-20 19:10:49,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:49,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1359125663, now seen corresponding path program 10 times [2024-06-20 19:10:49,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656547229] [2024-06-20 19:10:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15