./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:46:49,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:46:49,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:46:49,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:46:49,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:46:49,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:46:49,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:46:49,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:46:49,695 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:46:49,696 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:46:49,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:46:49,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:46:49,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:46:49,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:46:49,698 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:46:49,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:46:49,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:46:49,699 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:46:49,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:46:49,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:46:49,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:46:49,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:46:49,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:46:49,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:46:49,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:46:49,710 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:46:49,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:46:49,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:46:49,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:46:49,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:46:49,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:46:49,713 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:46:49,713 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:46:49,713 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:46:49,714 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:46:49,714 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:46:49,714 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:46:49,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:46:49,714 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:46:49,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:46:49,715 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:46:49,715 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:46:49,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:46:49,715 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-03 22:46:49,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:46:49,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:46:49,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:46:49,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:46:49,934 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:46:49,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:46:51,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:46:51,369 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:46:51,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:46:51,394 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817b5597f/bdf5857f063e4e5abe2df66f4b80bb28/FLAG1ced75521 [2024-06-03 22:46:51,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/817b5597f/bdf5857f063e4e5abe2df66f4b80bb28 [2024-06-03 22:46:51,409 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:46:51,409 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:46:51,410 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/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:46:51,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:46:51,575 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:46:51,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:46:51,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:46:51,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:46:51,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:46:51" (1/2) ... [2024-06-03 22:46:51,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25129fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:51, skipping insertion in model container [2024-06-03 22:46:51,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:46:51" (1/2) ... [2024-06-03 22:46:51,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f1a6ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:46:51, skipping insertion in model container [2024-06-03 22:46:51,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:51" (2/2) ... [2024-06-03 22:46:51,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25129fb5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:51, skipping insertion in model container [2024-06-03 22:46:51,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:51" (2/2) ... [2024-06-03 22:46:51,588 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:46:51,647 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:46:51,649 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-03 22:46:51,649 INFO L97 edCorrectnessWitness]: Location invariant before [L807-L807] ((((((((((((((! multithreaded || ((0 <= __unbuffered_p0_EAX && __unbuffered_p0_EAX <= 1) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd1 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd1 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd1 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y >= 0LL) && (2LL + (long long )__unbuffered_p0_EAX) - (long long )y >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y >= 0LL) && (2LL + (long long )x) - (long long )y >= 0LL) && (2LL + (long long )x$flush_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$mem_tmp) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff0_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL + (long long )x$r_buff1_thd2) - (long long )y >= 0LL) && (2LL + (long long )x$read_delayed) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff0) - (long long )y >= 0LL) && (2LL + (long long )x$w_buff1) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )x$read_delayed >= 0LL) && (2LL - (long long )x$r_buff0_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd0) - (long long )y >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )y >= 0LL) && (2LL - (long long )x$read_delayed) - (long long )y >= 0LL) && (3LL - (long long )weak$$choice0) - (long long )y >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p0_EAX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && y <= 2) && y <= 127) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1)))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-03 22:46:51,650 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:46:51,650 INFO L106 edCorrectnessWitness]: ghost_update [L804-L804] multithreaded = 1; [2024-06-03 22:46:51,701 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:46:52,069 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:46:52,078 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:46:52,389 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:46:52,428 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:46:52,430 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52 WrapperNode [2024-06-03 22:46:52,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:46:52,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:46:52,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:46:52,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:46:52,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,573 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 112 [2024-06-03 22:46:52,574 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:46:52,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:46:52,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:46:52,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:46:52,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,641 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-03 22:46:52,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:46:52,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:46:52,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:46:52,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:46:52,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (1/1) ... [2024-06-03 22:46:52,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:46:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:46:52,746 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-03 22:46:52,773 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-03 22:46:52,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:46:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:46:52,793 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:46:52,793 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:46:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:46:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:46:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:46:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:46:52,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:46:52,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:46:52,796 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:46:52,956 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:46:52,958 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:46:53,776 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:46:53,776 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:46:53,984 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:46:53,984 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:46:53,986 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:46:53 BoogieIcfgContainer [2024-06-03 22:46:53,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:46:53,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:46:53,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:46:53,993 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:46:53,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:46:51" (1/4) ... [2024-06-03 22:46:53,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c46508d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:46:53, skipping insertion in model container [2024-06-03 22:46:53,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:46:51" (2/4) ... [2024-06-03 22:46:53,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c46508d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:46:53, skipping insertion in model container [2024-06-03 22:46:53,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:46:52" (3/4) ... [2024-06-03 22:46:53,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c46508d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:46:53, skipping insertion in model container [2024-06-03 22:46:53,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:46:53" (4/4) ... [2024-06-03 22:46:54,000 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:46:54,018 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:46:54,018 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:46:54,018 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:46:54,121 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:46:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:46:54,207 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-03 22:46:54,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:46:54,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:46:54,210 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:46:54,214 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-03 22:46:54,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:46:54,236 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;@1e8362e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:46:54,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:46:54,246 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:46:54,247 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:46:54,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:46:54,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:54,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:46:54,249 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-03 22:46:54,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:54,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1303796410, now seen corresponding path program 1 times [2024-06-03 22:46:54,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:54,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116514204] [2024-06-03 22:46:54,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:54,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:46:58,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:58,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116514204] [2024-06-03 22:46:58,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116514204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:58,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:58,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:46:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438981555] [2024-06-03 22:46:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:58,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:46:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:46:58,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:46:58,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-03 22:46:58,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:58,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:58,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-03 22:46:58,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:58,408 INFO L124 PetriNetUnfolderBase]: 131/254 cut-off events. [2024-06-03 22:46:58,408 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-03 22:46:58,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 254 events. 131/254 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 963 event pairs, 75 based on Foata normal form. 1/249 useless extension candidates. Maximal degree in co-relation 498. Up to 235 conditions per place. [2024-06-03 22:46:58,413 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 22 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-03 22:46:58,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 117 flow [2024-06-03 22:46:58,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:46:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:46:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-03 22:46:58,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5806451612903226 [2024-06-03 22:46:58,426 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 54 transitions. [2024-06-03 22:46:58,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 117 flow [2024-06-03 22:46:58,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:46:58,431 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-03 22:46:58,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-03 22:46:58,436 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-03 22:46:58,436 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-03 22:46:58,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:46:58,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:58,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:58,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:46:58,437 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-03 22:46:58,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:58,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1182063719, now seen corresponding path program 1 times [2024-06-03 22:46:58,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:58,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165932091] [2024-06-03 22:46:58,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165932091] [2024-06-03 22:47:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165932091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:01,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:01,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:47:01,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935227589] [2024-06-03 22:47:01,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:01,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:47:01,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:47:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:47:01,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-03 22:47:01,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:01,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:01,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-03 22:47:01,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:01,506 INFO L124 PetriNetUnfolderBase]: 128/249 cut-off events. [2024-06-03 22:47:01,507 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-06-03 22:47:01,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 249 events. 128/249 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 927 event pairs, 57 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 559. Up to 221 conditions per place. [2024-06-03 22:47:01,509 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-03 22:47:01,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 159 flow [2024-06-03 22:47:01,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:47:01,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:47:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-06-03 22:47:01,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2024-06-03 22:47:01,514 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 69 transitions. [2024-06-03 22:47:01,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 159 flow [2024-06-03 22:47:01,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:47:01,517 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-03 22:47:01,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-03 22:47:01,518 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-03 22:47:01,518 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-03 22:47:01,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:01,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:01,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:01,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:47:01,519 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-03 22:47:01,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:01,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2091829128, now seen corresponding path program 1 times [2024-06-03 22:47:01,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:01,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49687704] [2024-06-03 22:47:01,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:01,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49687704] [2024-06-03 22:47:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49687704] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:47:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959536175] [2024-06-03 22:47:05,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:05,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:47:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:47:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:47:05,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-03 22:47:05,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:05,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:05,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-03 22:47:05,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:05,625 INFO L124 PetriNetUnfolderBase]: 125/244 cut-off events. [2024-06-03 22:47:05,625 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-06-03 22:47:05,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 244 events. 125/244 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 891 event pairs, 39 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 612. Up to 207 conditions per place. [2024-06-03 22:47:05,629 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 30 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2024-06-03 22:47:05,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 207 flow [2024-06-03 22:47:05,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:47:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:47:05,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-06-03 22:47:05,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5419354838709678 [2024-06-03 22:47:05,634 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 84 transitions. [2024-06-03 22:47:05,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 207 flow [2024-06-03 22:47:05,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 198 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:47:05,639 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 119 flow [2024-06-03 22:47:05,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-06-03 22:47:05,641 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-03 22:47:05,641 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 119 flow [2024-06-03 22:47:05,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:05,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:05,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:05,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:47:05,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:47:05,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1183318545, now seen corresponding path program 1 times [2024-06-03 22:47:05,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:05,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238409600] [2024-06-03 22:47:05,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:10,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238409600] [2024-06-03 22:47:10,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238409600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:10,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:10,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:47:10,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366091221] [2024-06-03 22:47:10,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:10,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:47:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:10,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:47:10,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:47:10,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:10,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:10,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:10,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:10,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:10,383 INFO L124 PetriNetUnfolderBase]: 123/241 cut-off events. [2024-06-03 22:47:10,383 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-06-03 22:47:10,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 241 events. 123/241 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 875 event pairs, 38 based on Foata normal form. 1/241 useless extension candidates. Maximal degree in co-relation 669. Up to 219 conditions per place. [2024-06-03 22:47:10,386 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 26 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2024-06-03 22:47:10,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 201 flow [2024-06-03 22:47:10,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:47:10,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:47:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-06-03 22:47:10,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2024-06-03 22:47:10,389 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 119 flow. Second operand 5 states and 69 transitions. [2024-06-03 22:47:10,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 201 flow [2024-06-03 22:47:10,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 186 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:47:10,392 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 131 flow [2024-06-03 22:47:10,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-03 22:47:10,394 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-03 22:47:10,394 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 131 flow [2024-06-03 22:47:10,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:10,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:10,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:10,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:47:10,395 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-03 22:47:10,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1987406221, now seen corresponding path program 1 times [2024-06-03 22:47:10,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:10,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863495049] [2024-06-03 22:47:10,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:10,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863495049] [2024-06-03 22:47:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863495049] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:47:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038517050] [2024-06-03 22:47:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:13,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:47:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:47:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:47:13,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2024-06-03 22:47:13,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:13,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:13,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2024-06-03 22:47:13,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:13,746 INFO L124 PetriNetUnfolderBase]: 119/233 cut-off events. [2024-06-03 22:47:13,747 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2024-06-03 22:47:13,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 233 events. 119/233 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 827 event pairs, 19 based on Foata normal form. 4/236 useless extension candidates. Maximal degree in co-relation 678. Up to 178 conditions per place. [2024-06-03 22:47:13,750 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 32 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-03 22:47:13,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 44 transitions, 237 flow [2024-06-03 22:47:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2024-06-03 22:47:13,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2024-06-03 22:47:13,752 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 131 flow. Second operand 6 states and 94 transitions. [2024-06-03 22:47:13,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 44 transitions, 237 flow [2024-06-03 22:47:13,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 226 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:47:13,758 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 132 flow [2024-06-03 22:47:13,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-03 22:47:13,760 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 11 predicate places. [2024-06-03 22:47:13,762 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 132 flow [2024-06-03 22:47:13,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:13,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:13,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:47:13,767 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-03 22:47:13,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1971832074, now seen corresponding path program 1 times [2024-06-03 22:47:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016523685] [2024-06-03 22:47:13,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:13,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:17,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:17,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:17,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016523685] [2024-06-03 22:47:17,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016523685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:17,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:17,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:47:17,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774083100] [2024-06-03 22:47:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:17,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:47:17,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:47:17,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:47:17,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:17,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 132 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-03 22:47:17,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:17,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:17,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:18,074 INFO L124 PetriNetUnfolderBase]: 135/263 cut-off events. [2024-06-03 22:47:18,075 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2024-06-03 22:47:18,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 263 events. 135/263 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1016 event pairs, 35 based on Foata normal form. 3/263 useless extension candidates. Maximal degree in co-relation 795. Up to 195 conditions per place. [2024-06-03 22:47:18,077 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 29 selfloop transitions, 12 changer transitions 0/45 dead transitions. [2024-06-03 22:47:18,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 270 flow [2024-06-03 22:47:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:18,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:18,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-03 22:47:18,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-03 22:47:18,079 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 132 flow. Second operand 6 states and 86 transitions. [2024-06-03 22:47:18,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 270 flow [2024-06-03 22:47:18,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 250 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-03 22:47:18,082 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 180 flow [2024-06-03 22:47:18,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-06-03 22:47:18,083 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2024-06-03 22:47:18,083 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 180 flow [2024-06-03 22:47:18,083 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-03 22:47:18,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:18,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:18,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:47:18,084 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-03 22:47:18,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1065870266, now seen corresponding path program 1 times [2024-06-03 22:47:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:18,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356754044] [2024-06-03 22:47:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356754044] [2024-06-03 22:47:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356754044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:21,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:21,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:47:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491647533] [2024-06-03 22:47:21,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:21,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:47:21,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:47:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:47:21,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:21,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 180 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-03 22:47:21,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:21,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:21,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:22,121 INFO L124 PetriNetUnfolderBase]: 145/286 cut-off events. [2024-06-03 22:47:22,121 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2024-06-03 22:47:22,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 286 events. 145/286 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1124 event pairs, 37 based on Foata normal form. 2/287 useless extension candidates. Maximal degree in co-relation 980. Up to 241 conditions per place. [2024-06-03 22:47:22,124 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 11 changer transitions 0/52 dead transitions. [2024-06-03 22:47:22,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 338 flow [2024-06-03 22:47:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 95 transitions. [2024-06-03 22:47:22,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377880184331797 [2024-06-03 22:47:22,125 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 180 flow. Second operand 7 states and 95 transitions. [2024-06-03 22:47:22,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 338 flow [2024-06-03 22:47:22,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-03 22:47:22,128 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 235 flow [2024-06-03 22:47:22,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-03 22:47:22,129 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-03 22:47:22,129 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 235 flow [2024-06-03 22:47:22,130 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-03 22:47:22,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:22,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:22,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:47:22,131 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-03 22:47:22,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash -222427366, now seen corresponding path program 2 times [2024-06-03 22:47:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:22,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871957719] [2024-06-03 22:47:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:22,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:25,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:25,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871957719] [2024-06-03 22:47:25,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871957719] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:25,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:25,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:47:25,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562511524] [2024-06-03 22:47:25,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:25,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:47:25,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:25,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:47:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:47:25,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:25,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 235 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-03 22:47:25,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:25,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:25,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:25,849 INFO L124 PetriNetUnfolderBase]: 151/300 cut-off events. [2024-06-03 22:47:25,849 INFO L125 PetriNetUnfolderBase]: For 1038/1038 co-relation queries the response was YES. [2024-06-03 22:47:25,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 300 events. 151/300 cut-off events. For 1038/1038 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1221 event pairs, 34 based on Foata normal form. 2/301 useless extension candidates. Maximal degree in co-relation 1104. Up to 245 conditions per place. [2024-06-03 22:47:25,852 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2024-06-03 22:47:25,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 376 flow [2024-06-03 22:47:25,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2024-06-03 22:47:25,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44623655913978494 [2024-06-03 22:47:25,857 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 235 flow. Second operand 6 states and 83 transitions. [2024-06-03 22:47:25,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 376 flow [2024-06-03 22:47:25,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 355 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:47:25,860 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 269 flow [2024-06-03 22:47:25,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=214, 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=6, PETRI_FLOW=269, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-06-03 22:47:25,863 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 22 predicate places. [2024-06-03 22:47:25,863 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 269 flow [2024-06-03 22:47:25,863 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-03 22:47:25,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:25,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:25,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:47:25,864 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-03 22:47:25,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:25,864 INFO L85 PathProgramCache]: Analyzing trace with hash 997244558, now seen corresponding path program 3 times [2024-06-03 22:47:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48950314] [2024-06-03 22:47:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:29,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48950314] [2024-06-03 22:47:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48950314] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:29,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:29,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:47:29,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176239358] [2024-06-03 22:47:29,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:29,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:47:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:29,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:47:29,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:47:29,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:29,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 269 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-03 22:47:29,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:29,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:29,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:29,761 INFO L124 PetriNetUnfolderBase]: 141/282 cut-off events. [2024-06-03 22:47:29,761 INFO L125 PetriNetUnfolderBase]: For 1255/1255 co-relation queries the response was YES. [2024-06-03 22:47:29,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 282 events. 141/282 cut-off events. For 1255/1255 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1113 event pairs, 36 based on Foata normal form. 4/282 useless extension candidates. Maximal degree in co-relation 1056. Up to 195 conditions per place. [2024-06-03 22:47:29,764 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 16 changer transitions 0/51 dead transitions. [2024-06-03 22:47:29,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 387 flow [2024-06-03 22:47:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:29,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2024-06-03 22:47:29,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45698924731182794 [2024-06-03 22:47:29,766 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 269 flow. Second operand 6 states and 85 transitions. [2024-06-03 22:47:29,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 387 flow [2024-06-03 22:47:29,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 357 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:47:29,769 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 278 flow [2024-06-03 22:47:29,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-03 22:47:29,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 24 predicate places. [2024-06-03 22:47:29,770 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 278 flow [2024-06-03 22:47:29,770 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-03 22:47:29,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:29,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:29,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:47:29,771 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:47:29,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:29,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1274309786, now seen corresponding path program 1 times [2024-06-03 22:47:29,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:29,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649255911] [2024-06-03 22:47:29,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:29,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:34,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:34,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649255911] [2024-06-03 22:47:34,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649255911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:34,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:34,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:34,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728426595] [2024-06-03 22:47:34,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:34,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:34,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:34,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:34,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:34,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 278 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:34,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:34,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:34,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:34,390 INFO L124 PetriNetUnfolderBase]: 145/291 cut-off events. [2024-06-03 22:47:34,390 INFO L125 PetriNetUnfolderBase]: For 1149/1149 co-relation queries the response was YES. [2024-06-03 22:47:34,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1104 conditions, 291 events. 145/291 cut-off events. For 1149/1149 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1164 event pairs, 32 based on Foata normal form. 3/290 useless extension candidates. Maximal degree in co-relation 1076. Up to 193 conditions per place. [2024-06-03 22:47:34,393 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 0/56 dead transitions. [2024-06-03 22:47:34,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 428 flow [2024-06-03 22:47:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:34,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:34,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:47:34,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 22:47:34,394 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 278 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:47:34,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 428 flow [2024-06-03 22:47:34,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 56 transitions, 383 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:34,399 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 312 flow [2024-06-03 22:47:34,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2024-06-03 22:47:34,401 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-03 22:47:34,403 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 312 flow [2024-06-03 22:47:34,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:34,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:34,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:34,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:47:34,403 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-03 22:47:34,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash 850088361, now seen corresponding path program 1 times [2024-06-03 22:47:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:34,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014255907] [2024-06-03 22:47:34,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:34,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:39,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:39,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:39,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014255907] [2024-06-03 22:47:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014255907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:47:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941739672] [2024-06-03 22:47:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:39,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:47:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:39,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:47:39,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:47:39,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:39,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 312 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:39,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:39,590 INFO L124 PetriNetUnfolderBase]: 162/328 cut-off events. [2024-06-03 22:47:39,591 INFO L125 PetriNetUnfolderBase]: For 1700/1700 co-relation queries the response was YES. [2024-06-03 22:47:39,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 328 events. 162/328 cut-off events. For 1700/1700 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1363 event pairs, 36 based on Foata normal form. 14/338 useless extension candidates. Maximal degree in co-relation 1242. Up to 178 conditions per place. [2024-06-03 22:47:39,594 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 30 selfloop transitions, 22 changer transitions 7/63 dead transitions. [2024-06-03 22:47:39,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 488 flow [2024-06-03 22:47:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:47:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:47:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 22:47:39,597 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45564516129032256 [2024-06-03 22:47:39,597 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 312 flow. Second operand 8 states and 113 transitions. [2024-06-03 22:47:39,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 488 flow [2024-06-03 22:47:39,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 63 transitions, 437 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:39,601 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 309 flow [2024-06-03 22:47:39,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=309, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2024-06-03 22:47:39,602 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2024-06-03 22:47:39,602 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 309 flow [2024-06-03 22:47:39,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:39,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:39,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:39,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:47:39,603 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-03 22:47:39,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash 94762925, now seen corresponding path program 1 times [2024-06-03 22:47:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697384840] [2024-06-03 22:47:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:43,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-03 22:47:43,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:43,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697384840] [2024-06-03 22:47:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697384840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:43,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:43,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:43,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005720394] [2024-06-03 22:47:43,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:43,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:43,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:43,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:43,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:43,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 309 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:43,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:43,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:43,716 INFO L124 PetriNetUnfolderBase]: 148/307 cut-off events. [2024-06-03 22:47:43,716 INFO L125 PetriNetUnfolderBase]: For 1346/1346 co-relation queries the response was YES. [2024-06-03 22:47:43,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 307 events. 148/307 cut-off events. For 1346/1346 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1282 event pairs, 34 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 1212. Up to 249 conditions per place. [2024-06-03 22:47:43,719 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 44 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2024-06-03 22:47:43,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 469 flow [2024-06-03 22:47:43,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-03 22:47:43,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-03 22:47:43,722 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 309 flow. Second operand 7 states and 96 transitions. [2024-06-03 22:47:43,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 469 flow [2024-06-03 22:47:43,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 420 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:47:43,730 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 307 flow [2024-06-03 22:47:43,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-06-03 22:47:43,730 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 30 predicate places. [2024-06-03 22:47:43,731 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 307 flow [2024-06-03 22:47:43,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:43,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:43,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:43,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:47:43,732 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-03 22:47:43,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 582629231, now seen corresponding path program 1 times [2024-06-03 22:47:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426987878] [2024-06-03 22:47:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:43,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:47,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-03 22:47:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:47,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426987878] [2024-06-03 22:47:47,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426987878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:47,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:47,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:47,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36356863] [2024-06-03 22:47:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:47,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:47,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:47,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:47,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:47,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:47,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 307 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:47,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:47,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:47,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:48,136 INFO L124 PetriNetUnfolderBase]: 154/317 cut-off events. [2024-06-03 22:47:48,137 INFO L125 PetriNetUnfolderBase]: For 1574/1574 co-relation queries the response was YES. [2024-06-03 22:47:48,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 317 events. 154/317 cut-off events. For 1574/1574 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1317 event pairs, 36 based on Foata normal form. 2/315 useless extension candidates. Maximal degree in co-relation 1247. Up to 222 conditions per place. [2024-06-03 22:47:48,139 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 18 changer transitions 0/60 dead transitions. [2024-06-03 22:47:48,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 60 transitions, 475 flow [2024-06-03 22:47:48,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:48,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-03 22:47:48,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4470046082949309 [2024-06-03 22:47:48,142 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 307 flow. Second operand 7 states and 97 transitions. [2024-06-03 22:47:48,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 60 transitions, 475 flow [2024-06-03 22:47:48,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 444 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:48,146 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 346 flow [2024-06-03 22:47:48,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-06-03 22:47:48,147 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-03 22:47:48,147 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 346 flow [2024-06-03 22:47:48,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:48,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:48,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:48,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:47:48,148 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-03 22:47:48,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:48,148 INFO L85 PathProgramCache]: Analyzing trace with hash 582925901, now seen corresponding path program 2 times [2024-06-03 22:47:48,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:48,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675081531] [2024-06-03 22:47:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:48,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:52,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:52,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:52,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675081531] [2024-06-03 22:47:52,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675081531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:52,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:52,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:52,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939766344] [2024-06-03 22:47:52,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:52,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:52,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:52,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:52,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:52,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:52,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:52,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:52,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:52,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:52,645 INFO L124 PetriNetUnfolderBase]: 152/314 cut-off events. [2024-06-03 22:47:52,645 INFO L125 PetriNetUnfolderBase]: For 1747/1747 co-relation queries the response was YES. [2024-06-03 22:47:52,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 314 events. 152/314 cut-off events. For 1747/1747 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1309 event pairs, 36 based on Foata normal form. 1/311 useless extension candidates. Maximal degree in co-relation 1305. Up to 207 conditions per place. [2024-06-03 22:47:52,648 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2024-06-03 22:47:52,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 61 transitions, 504 flow [2024-06-03 22:47:52,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:47:52,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:47:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2024-06-03 22:47:52,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423963133640553 [2024-06-03 22:47:52,650 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 346 flow. Second operand 7 states and 96 transitions. [2024-06-03 22:47:52,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 61 transitions, 504 flow [2024-06-03 22:47:52,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 456 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:52,654 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 363 flow [2024-06-03 22:47:52,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2024-06-03 22:47:52,655 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 34 predicate places. [2024-06-03 22:47:52,655 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 363 flow [2024-06-03 22:47:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:52,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:52,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:52,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:47:52,656 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-03 22:47:52,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:52,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1310038016, now seen corresponding path program 1 times [2024-06-03 22:47:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:52,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233875036] [2024-06-03 22:47:52,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:52,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:47:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:47:55,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:47:55,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233875036] [2024-06-03 22:47:55,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233875036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:47:55,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:47:55,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:47:55,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329805709] [2024-06-03 22:47:55,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:47:55,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:47:55,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:47:55,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:47:55,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:47:55,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:47:55,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:55,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:47:55,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:47:55,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:47:56,187 INFO L124 PetriNetUnfolderBase]: 150/308 cut-off events. [2024-06-03 22:47:56,188 INFO L125 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2024-06-03 22:47:56,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 308 events. 150/308 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1288 event pairs, 37 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 1314. Up to 204 conditions per place. [2024-06-03 22:47:56,191 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 21 changer transitions 1/63 dead transitions. [2024-06-03 22:47:56,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 63 transitions, 537 flow [2024-06-03 22:47:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:47:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:47:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2024-06-03 22:47:56,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2024-06-03 22:47:56,192 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 363 flow. Second operand 6 states and 86 transitions. [2024-06-03 22:47:56,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 63 transitions, 537 flow [2024-06-03 22:47:56,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 488 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:47:56,197 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 387 flow [2024-06-03 22:47:56,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=387, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-06-03 22:47:56,197 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 35 predicate places. [2024-06-03 22:47:56,198 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 387 flow [2024-06-03 22:47:56,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:47:56,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:47:56,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:47:56,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:47:56,199 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-03 22:47:56,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:47:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1824675192, now seen corresponding path program 1 times [2024-06-03 22:47:56,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:47:56,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138264460] [2024-06-03 22:47:56,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:47:56,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:47:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138264460] [2024-06-03 22:48:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138264460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467827229] [2024-06-03 22:48:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:00,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:00,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:00,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:00,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 387 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:00,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:00,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:00,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:00,849 INFO L124 PetriNetUnfolderBase]: 154/321 cut-off events. [2024-06-03 22:48:00,850 INFO L125 PetriNetUnfolderBase]: For 2298/2298 co-relation queries the response was YES. [2024-06-03 22:48:00,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 321 events. 154/321 cut-off events. For 2298/2298 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1359 event pairs, 33 based on Foata normal form. 2/319 useless extension candidates. Maximal degree in co-relation 1392. Up to 242 conditions per place. [2024-06-03 22:48:00,852 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 48 selfloop transitions, 17 changer transitions 4/73 dead transitions. [2024-06-03 22:48:00,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 73 transitions, 641 flow [2024-06-03 22:48:00,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 22:48:00,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-03 22:48:00,855 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 387 flow. Second operand 8 states and 105 transitions. [2024-06-03 22:48:00,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 73 transitions, 641 flow [2024-06-03 22:48:00,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 586 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:48:00,860 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 442 flow [2024-06-03 22:48:00,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=442, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2024-06-03 22:48:00,861 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 40 predicate places. [2024-06-03 22:48:00,861 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 442 flow [2024-06-03 22:48:00,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:00,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:00,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:48:00,862 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-03 22:48:00,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:00,863 INFO L85 PathProgramCache]: Analyzing trace with hash -252074498, now seen corresponding path program 2 times [2024-06-03 22:48:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524584198] [2024-06-03 22:48:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:00,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:05,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524584198] [2024-06-03 22:48:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524584198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:05,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689721436] [2024-06-03 22:48:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:05,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:05,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:05,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:05,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 442 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:05,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:05,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:05,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:05,746 INFO L124 PetriNetUnfolderBase]: 165/348 cut-off events. [2024-06-03 22:48:05,746 INFO L125 PetriNetUnfolderBase]: For 3505/3505 co-relation queries the response was YES. [2024-06-03 22:48:05,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 348 events. 165/348 cut-off events. For 3505/3505 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1523 event pairs, 39 based on Foata normal form. 14/358 useless extension candidates. Maximal degree in co-relation 1501. Up to 182 conditions per place. [2024-06-03 22:48:05,749 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 6/76 dead transitions. [2024-06-03 22:48:05,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 76 transitions, 662 flow [2024-06-03 22:48:05,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:48:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:48:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-03 22:48:05,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44802867383512546 [2024-06-03 22:48:05,751 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 442 flow. Second operand 9 states and 125 transitions. [2024-06-03 22:48:05,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 76 transitions, 662 flow [2024-06-03 22:48:05,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 620 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-03 22:48:05,757 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 464 flow [2024-06-03 22:48:05,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=464, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2024-06-03 22:48:05,758 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-03 22:48:05,758 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 464 flow [2024-06-03 22:48:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:05,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:05,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:05,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:48:05,759 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-03 22:48:05,759 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:05,760 INFO L85 PathProgramCache]: Analyzing trace with hash 891161544, now seen corresponding path program 3 times [2024-06-03 22:48:05,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:05,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418602335] [2024-06-03 22:48:05,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:05,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418602335] [2024-06-03 22:48:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418602335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990936123] [2024-06-03 22:48:09,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:09,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:09,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 464 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:09,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:09,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:09,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:10,178 INFO L124 PetriNetUnfolderBase]: 153/330 cut-off events. [2024-06-03 22:48:10,178 INFO L125 PetriNetUnfolderBase]: For 2213/2213 co-relation queries the response was YES. [2024-06-03 22:48:10,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 330 events. 153/330 cut-off events. For 2213/2213 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1412 event pairs, 34 based on Foata normal form. 2/328 useless extension candidates. Maximal degree in co-relation 1402. Up to 212 conditions per place. [2024-06-03 22:48:10,181 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 43 selfloop transitions, 22 changer transitions 2/71 dead transitions. [2024-06-03 22:48:10,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 642 flow [2024-06-03 22:48:10,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 22:48:10,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:48:10,182 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 464 flow. Second operand 8 states and 104 transitions. [2024-06-03 22:48:10,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 642 flow [2024-06-03 22:48:10,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 569 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-03 22:48:10,189 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 439 flow [2024-06-03 22:48:10,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=439, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-06-03 22:48:10,189 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-03 22:48:10,189 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 439 flow [2024-06-03 22:48:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:10,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:10,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:10,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:48:10,190 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-03 22:48:10,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:10,191 INFO L85 PathProgramCache]: Analyzing trace with hash 870037580, now seen corresponding path program 1 times [2024-06-03 22:48:10,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:10,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869679695] [2024-06-03 22:48:10,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:14,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:14,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:14,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869679695] [2024-06-03 22:48:14,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869679695] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:14,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:14,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:14,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552291119] [2024-06-03 22:48:14,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:14,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:14,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:14,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:14,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 439 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:14,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:14,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:14,471 INFO L124 PetriNetUnfolderBase]: 157/340 cut-off events. [2024-06-03 22:48:14,471 INFO L125 PetriNetUnfolderBase]: For 2192/2192 co-relation queries the response was YES. [2024-06-03 22:48:14,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 340 events. 157/340 cut-off events. For 2192/2192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1481 event pairs, 19 based on Foata normal form. 2/341 useless extension candidates. Maximal degree in co-relation 1408. Up to 251 conditions per place. [2024-06-03 22:48:14,473 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 59 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2024-06-03 22:48:14,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 631 flow [2024-06-03 22:48:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-03 22:48:14,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4274193548387097 [2024-06-03 22:48:14,475 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 439 flow. Second operand 8 states and 106 transitions. [2024-06-03 22:48:14,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 631 flow [2024-06-03 22:48:14,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 576 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:48:14,481 INFO L231 Difference]: Finished difference. Result has 77 places, 60 transitions, 424 flow [2024-06-03 22:48:14,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=424, PETRI_PLACES=77, PETRI_TRANSITIONS=60} [2024-06-03 22:48:14,482 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-03 22:48:14,482 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 60 transitions, 424 flow [2024-06-03 22:48:14,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:14,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:14,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:14,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:48:14,483 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-03 22:48:14,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:14,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1078969950, now seen corresponding path program 2 times [2024-06-03 22:48:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:14,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221898431] [2024-06-03 22:48:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:14,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:18,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:18,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221898431] [2024-06-03 22:48:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221898431] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:18,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896074060] [2024-06-03 22:48:18,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:18,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:18,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:18,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:18,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:18,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 60 transitions, 424 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:18,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:18,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:18,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:18,614 INFO L124 PetriNetUnfolderBase]: 161/348 cut-off events. [2024-06-03 22:48:18,614 INFO L125 PetriNetUnfolderBase]: For 2297/2297 co-relation queries the response was YES. [2024-06-03 22:48:18,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 348 events. 161/348 cut-off events. For 2297/2297 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1521 event pairs, 33 based on Foata normal form. 2/349 useless extension candidates. Maximal degree in co-relation 1409. Up to 276 conditions per place. [2024-06-03 22:48:18,617 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 58 selfloop transitions, 13 changer transitions 0/75 dead transitions. [2024-06-03 22:48:18,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 616 flow [2024-06-03 22:48:18,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 22:48:18,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-03 22:48:18,620 INFO L175 Difference]: Start difference. First operand has 77 places, 60 transitions, 424 flow. Second operand 8 states and 107 transitions. [2024-06-03 22:48:18,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 616 flow [2024-06-03 22:48:18,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 75 transitions, 586 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:18,625 INFO L231 Difference]: Finished difference. Result has 79 places, 61 transitions, 438 flow [2024-06-03 22:48:18,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=438, PETRI_PLACES=79, PETRI_TRANSITIONS=61} [2024-06-03 22:48:18,626 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 49 predicate places. [2024-06-03 22:48:18,626 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 61 transitions, 438 flow [2024-06-03 22:48:18,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:18,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:18,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:18,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:48:18,627 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-03 22:48:18,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1078964990, now seen corresponding path program 1 times [2024-06-03 22:48:18,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:18,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485973199] [2024-06-03 22:48:18,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:18,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:18,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:22,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:22,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:22,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485973199] [2024-06-03 22:48:22,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485973199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:22,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:22,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:22,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990223713] [2024-06-03 22:48:22,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:22,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:22,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:22,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:22,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 61 transitions, 438 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:22,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:22,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:22,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:22,970 INFO L124 PetriNetUnfolderBase]: 164/350 cut-off events. [2024-06-03 22:48:22,970 INFO L125 PetriNetUnfolderBase]: For 2539/2539 co-relation queries the response was YES. [2024-06-03 22:48:22,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 350 events. 164/350 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1532 event pairs, 37 based on Foata normal form. 1/345 useless extension candidates. Maximal degree in co-relation 1445. Up to 250 conditions per place. [2024-06-03 22:48:22,973 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 25 changer transitions 3/73 dead transitions. [2024-06-03 22:48:22,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 73 transitions, 640 flow [2024-06-03 22:48:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:48:22,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:48:22,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-06-03 22:48:22,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45622119815668205 [2024-06-03 22:48:22,975 INFO L175 Difference]: Start difference. First operand has 79 places, 61 transitions, 438 flow. Second operand 7 states and 99 transitions. [2024-06-03 22:48:22,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 73 transitions, 640 flow [2024-06-03 22:48:22,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 73 transitions, 606 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:22,981 INFO L231 Difference]: Finished difference. Result has 80 places, 63 transitions, 489 flow [2024-06-03 22:48:22,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=80, PETRI_TRANSITIONS=63} [2024-06-03 22:48:22,982 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 50 predicate places. [2024-06-03 22:48:22,982 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 63 transitions, 489 flow [2024-06-03 22:48:22,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:22,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:22,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:22,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:48:22,983 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-03 22:48:22,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1153824844, now seen corresponding path program 3 times [2024-06-03 22:48:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929073012] [2024-06-03 22:48:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:26,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:26,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929073012] [2024-06-03 22:48:26,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929073012] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:26,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:26,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981319795] [2024-06-03 22:48:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:26,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:27,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:27,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 63 transitions, 489 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:27,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:27,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:27,230 INFO L124 PetriNetUnfolderBase]: 156/341 cut-off events. [2024-06-03 22:48:27,230 INFO L125 PetriNetUnfolderBase]: For 2490/2490 co-relation queries the response was YES. [2024-06-03 22:48:27,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1445 conditions, 341 events. 156/341 cut-off events. For 2490/2490 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1483 event pairs, 29 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1406. Up to 270 conditions per place. [2024-06-03 22:48:27,232 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 56 selfloop transitions, 14 changer transitions 0/74 dead transitions. [2024-06-03 22:48:27,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 74 transitions, 657 flow [2024-06-03 22:48:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-03 22:48:27,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4153225806451613 [2024-06-03 22:48:27,236 INFO L175 Difference]: Start difference. First operand has 80 places, 63 transitions, 489 flow. Second operand 8 states and 103 transitions. [2024-06-03 22:48:27,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 74 transitions, 657 flow [2024-06-03 22:48:27,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 74 transitions, 608 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-03 22:48:27,241 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 473 flow [2024-06-03 22:48:27,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2024-06-03 22:48:27,242 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-03 22:48:27,242 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 473 flow [2024-06-03 22:48:27,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:27,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:27,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:27,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:48:27,242 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-03 22:48:27,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:27,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2065474850, now seen corresponding path program 2 times [2024-06-03 22:48:27,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:27,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625958260] [2024-06-03 22:48:27,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:27,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625958260] [2024-06-03 22:48:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625958260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:31,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163525907] [2024-06-03 22:48:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:31,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:31,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:31,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:31,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 473 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:31,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:31,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:31,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:31,464 INFO L124 PetriNetUnfolderBase]: 159/343 cut-off events. [2024-06-03 22:48:31,464 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-06-03 22:48:31,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 343 events. 159/343 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1509 event pairs, 36 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 1393. Up to 228 conditions per place. [2024-06-03 22:48:31,467 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 41 selfloop transitions, 28 changer transitions 0/73 dead transitions. [2024-06-03 22:48:31,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 653 flow [2024-06-03 22:48:31,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:31,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2024-06-03 22:48:31,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43951612903225806 [2024-06-03 22:48:31,469 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 473 flow. Second operand 8 states and 109 transitions. [2024-06-03 22:48:31,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 653 flow [2024-06-03 22:48:31,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 584 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:48:31,474 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 491 flow [2024-06-03 22:48:31,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2024-06-03 22:48:31,475 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-03 22:48:31,475 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 491 flow [2024-06-03 22:48:31,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:31,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:31,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:31,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:48:31,477 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-03 22:48:31,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1560746718, now seen corresponding path program 3 times [2024-06-03 22:48:31,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:31,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516129071] [2024-06-03 22:48:31,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:31,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516129071] [2024-06-03 22:48:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516129071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279369335] [2024-06-03 22:48:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:35,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:36,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:36,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 65 transitions, 491 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:36,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:36,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:36,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:36,326 INFO L124 PetriNetUnfolderBase]: 162/353 cut-off events. [2024-06-03 22:48:36,326 INFO L125 PetriNetUnfolderBase]: For 2665/2665 co-relation queries the response was YES. [2024-06-03 22:48:36,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 353 events. 162/353 cut-off events. For 2665/2665 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1560 event pairs, 32 based on Foata normal form. 1/350 useless extension candidates. Maximal degree in co-relation 1441. Up to 257 conditions per place. [2024-06-03 22:48:36,329 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 52 selfloop transitions, 20 changer transitions 0/76 dead transitions. [2024-06-03 22:48:36,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 76 transitions, 683 flow [2024-06-03 22:48:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:48:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:48:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 22:48:36,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-03 22:48:36,332 INFO L175 Difference]: Start difference. First operand has 84 places, 65 transitions, 491 flow. Second operand 9 states and 116 transitions. [2024-06-03 22:48:36,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 76 transitions, 683 flow [2024-06-03 22:48:36,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 612 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:36,339 INFO L231 Difference]: Finished difference. Result has 87 places, 67 transitions, 495 flow [2024-06-03 22:48:36,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=495, PETRI_PLACES=87, PETRI_TRANSITIONS=67} [2024-06-03 22:48:36,340 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-03 22:48:36,340 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 67 transitions, 495 flow [2024-06-03 22:48:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:36,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:36,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:36,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:48:36,341 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-03 22:48:36,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1569020928, now seen corresponding path program 4 times [2024-06-03 22:48:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120367953] [2024-06-03 22:48:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:40,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:40,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120367953] [2024-06-03 22:48:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120367953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:40,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426928828] [2024-06-03 22:48:40,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:40,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:40,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:40,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 67 transitions, 495 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:40,521 INFO L124 PetriNetUnfolderBase]: 160/347 cut-off events. [2024-06-03 22:48:40,521 INFO L125 PetriNetUnfolderBase]: For 2735/2735 co-relation queries the response was YES. [2024-06-03 22:48:40,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 347 events. 160/347 cut-off events. For 2735/2735 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1534 event pairs, 36 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1405. Up to 218 conditions per place. [2024-06-03 22:48:40,524 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 45 selfloop transitions, 28 changer transitions 0/77 dead transitions. [2024-06-03 22:48:40,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 77 transitions, 691 flow [2024-06-03 22:48:40,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:48:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:48:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-03 22:48:40,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-03 22:48:40,526 INFO L175 Difference]: Start difference. First operand has 87 places, 67 transitions, 495 flow. Second operand 8 states and 108 transitions. [2024-06-03 22:48:40,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 77 transitions, 691 flow [2024-06-03 22:48:40,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 77 transitions, 629 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-03 22:48:40,534 INFO L231 Difference]: Finished difference. Result has 88 places, 69 transitions, 528 flow [2024-06-03 22:48:40,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2024-06-03 22:48:40,535 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-03 22:48:40,535 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 69 transitions, 528 flow [2024-06-03 22:48:40,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:40,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:40,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:40,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:48:40,536 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-03 22:48:40,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:40,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1354598209, now seen corresponding path program 1 times [2024-06-03 22:48:40,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846334271] [2024-06-03 22:48:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:40,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:45,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:45,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846334271] [2024-06-03 22:48:45,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846334271] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:45,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:45,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:45,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900714715] [2024-06-03 22:48:45,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:45,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:45,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:45,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:45,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:45,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 69 transitions, 528 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:45,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:45,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:45,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:45,472 INFO L124 PetriNetUnfolderBase]: 172/375 cut-off events. [2024-06-03 22:48:45,472 INFO L125 PetriNetUnfolderBase]: For 4344/4344 co-relation queries the response was YES. [2024-06-03 22:48:45,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1560 conditions, 375 events. 172/375 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1705 event pairs, 34 based on Foata normal form. 8/377 useless extension candidates. Maximal degree in co-relation 1518. Up to 255 conditions per place. [2024-06-03 22:48:45,475 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 57 selfloop transitions, 6 changer transitions 15/82 dead transitions. [2024-06-03 22:48:45,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 82 transitions, 730 flow [2024-06-03 22:48:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:48:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:48:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-03 22:48:45,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:48:45,477 INFO L175 Difference]: Start difference. First operand has 88 places, 69 transitions, 528 flow. Second operand 7 states and 93 transitions. [2024-06-03 22:48:45,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 82 transitions, 730 flow [2024-06-03 22:48:45,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 651 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:45,485 INFO L231 Difference]: Finished difference. Result has 89 places, 66 transitions, 447 flow [2024-06-03 22:48:45,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=447, PETRI_PLACES=89, PETRI_TRANSITIONS=66} [2024-06-03 22:48:45,486 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 59 predicate places. [2024-06-03 22:48:45,486 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 66 transitions, 447 flow [2024-06-03 22:48:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:45,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:45,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:45,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:48:45,487 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-03 22:48:45,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1349747507, now seen corresponding path program 2 times [2024-06-03 22:48:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:45,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611955155] [2024-06-03 22:48:45,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:49,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:49,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611955155] [2024-06-03 22:48:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611955155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:49,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:49,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:49,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354448136] [2024-06-03 22:48:49,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:49,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:49,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:49,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:49,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:49,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 66 transitions, 447 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:49,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:49,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:49,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:49,978 INFO L124 PetriNetUnfolderBase]: 148/325 cut-off events. [2024-06-03 22:48:49,978 INFO L125 PetriNetUnfolderBase]: For 3217/3217 co-relation queries the response was YES. [2024-06-03 22:48:49,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 325 events. 148/325 cut-off events. For 3217/3217 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1424 event pairs, 15 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1299. Up to 169 conditions per place. [2024-06-03 22:48:49,982 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 51 selfloop transitions, 19 changer transitions 0/74 dead transitions. [2024-06-03 22:48:49,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 74 transitions, 651 flow [2024-06-03 22:48:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:48:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:48:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 22:48:49,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4147465437788018 [2024-06-03 22:48:49,984 INFO L175 Difference]: Start difference. First operand has 89 places, 66 transitions, 447 flow. Second operand 7 states and 90 transitions. [2024-06-03 22:48:49,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 74 transitions, 651 flow [2024-06-03 22:48:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 74 transitions, 627 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:48:49,993 INFO L231 Difference]: Finished difference. Result has 85 places, 67 transitions, 479 flow [2024-06-03 22:48:49,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=85, PETRI_TRANSITIONS=67} [2024-06-03 22:48:49,993 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-03 22:48:49,994 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 67 transitions, 479 flow [2024-06-03 22:48:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:49,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:49,994 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:48:49,994 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-03 22:48:49,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1349599637, now seen corresponding path program 3 times [2024-06-03 22:48:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:49,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260137197] [2024-06-03 22:48:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:50,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:54,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260137197] [2024-06-03 22:48:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260137197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:54,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:48:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764394934] [2024-06-03 22:48:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:54,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:48:54,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:48:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:48:54,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:48:54,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 67 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:54,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:48:54,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:48:54,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:48:55,178 INFO L124 PetriNetUnfolderBase]: 145/320 cut-off events. [2024-06-03 22:48:55,179 INFO L125 PetriNetUnfolderBase]: For 2413/2413 co-relation queries the response was YES. [2024-06-03 22:48:55,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 320 events. 145/320 cut-off events. For 2413/2413 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1396 event pairs, 31 based on Foata normal form. 2/317 useless extension candidates. Maximal degree in co-relation 1273. Up to 209 conditions per place. [2024-06-03 22:48:55,181 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 47 selfloop transitions, 21 changer transitions 1/73 dead transitions. [2024-06-03 22:48:55,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 73 transitions, 635 flow [2024-06-03 22:48:55,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:48:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:48:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 91 transitions. [2024-06-03 22:48:55,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:48:55,183 INFO L175 Difference]: Start difference. First operand has 85 places, 67 transitions, 479 flow. Second operand 7 states and 91 transitions. [2024-06-03 22:48:55,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 73 transitions, 635 flow [2024-06-03 22:48:55,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 73 transitions, 597 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:48:55,190 INFO L231 Difference]: Finished difference. Result has 88 places, 67 transitions, 492 flow [2024-06-03 22:48:55,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=88, PETRI_TRANSITIONS=67} [2024-06-03 22:48:55,196 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-03 22:48:55,197 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 67 transitions, 492 flow [2024-06-03 22:48:55,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:48:55,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:48:55,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:48:55,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:48:55,198 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-03 22:48:55,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:48:55,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1349593685, now seen corresponding path program 1 times [2024-06-03 22:48:55,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:48:55,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140191795] [2024-06-03 22:48:55,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:48:55,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:48:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:48:59,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:48:59,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:48:59,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140191795] [2024-06-03 22:48:59,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140191795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:48:59,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:48:59,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:48:59,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407938881] [2024-06-03 22:48:59,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:48:59,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:48:59,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:48:59,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:48:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:00,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:00,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 67 transitions, 492 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:00,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:00,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:00,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:00,375 INFO L124 PetriNetUnfolderBase]: 145/328 cut-off events. [2024-06-03 22:49:00,375 INFO L125 PetriNetUnfolderBase]: For 3923/3923 co-relation queries the response was YES. [2024-06-03 22:49:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 328 events. 145/328 cut-off events. For 3923/3923 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1465 event pairs, 26 based on Foata normal form. 8/331 useless extension candidates. Maximal degree in co-relation 1325. Up to 162 conditions per place. [2024-06-03 22:49:00,377 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 39 selfloop transitions, 23 changer transitions 9/75 dead transitions. [2024-06-03 22:49:00,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 75 transitions, 680 flow [2024-06-03 22:49:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:49:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:49:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:49:00,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 22:49:00,379 INFO L175 Difference]: Start difference. First operand has 88 places, 67 transitions, 492 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:49:00,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 75 transitions, 680 flow [2024-06-03 22:49:00,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 75 transitions, 640 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-03 22:49:00,387 INFO L231 Difference]: Finished difference. Result has 90 places, 61 transitions, 463 flow [2024-06-03 22:49:00,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=463, PETRI_PLACES=90, PETRI_TRANSITIONS=61} [2024-06-03 22:49:00,388 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 60 predicate places. [2024-06-03 22:49:00,388 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 61 transitions, 463 flow [2024-06-03 22:49:00,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:00,388 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:00,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:00,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:49:00,389 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-03 22:49:00,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1615907273, now seen corresponding path program 2 times [2024-06-03 22:49:00,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230817655] [2024-06-03 22:49:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:05,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:05,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230817655] [2024-06-03 22:49:05,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230817655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:05,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:05,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:05,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102051964] [2024-06-03 22:49:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:05,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:05,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:05,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:05,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:05,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 61 transitions, 463 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:05,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:05,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:05,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:05,602 INFO L124 PetriNetUnfolderBase]: 151/349 cut-off events. [2024-06-03 22:49:05,602 INFO L125 PetriNetUnfolderBase]: For 5530/5530 co-relation queries the response was YES. [2024-06-03 22:49:05,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 349 events. 151/349 cut-off events. For 5530/5530 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1601 event pairs, 31 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1602. Up to 160 conditions per place. [2024-06-03 22:49:05,605 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 47 selfloop transitions, 22 changer transitions 5/78 dead transitions. [2024-06-03 22:49:05,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 78 transitions, 741 flow [2024-06-03 22:49:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2024-06-03 22:49:05,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44086021505376344 [2024-06-03 22:49:05,607 INFO L175 Difference]: Start difference. First operand has 90 places, 61 transitions, 463 flow. Second operand 9 states and 123 transitions. [2024-06-03 22:49:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 78 transitions, 741 flow [2024-06-03 22:49:05,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 78 transitions, 670 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-03 22:49:05,616 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 437 flow [2024-06-03 22:49:05,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=437, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2024-06-03 22:49:05,617 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-03 22:49:05,617 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 437 flow [2024-06-03 22:49:05,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:05,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:05,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:05,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:49:05,618 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-03 22:49:05,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:05,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1615640363, now seen corresponding path program 3 times [2024-06-03 22:49:05,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:05,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798895355] [2024-06-03 22:49:05,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:05,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:09,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:09,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798895355] [2024-06-03 22:49:09,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798895355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:09,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:09,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:09,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526836249] [2024-06-03 22:49:09,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:09,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:09,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:09,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:09,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:09,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:09,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 437 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:09,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:09,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:09,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:10,113 INFO L124 PetriNetUnfolderBase]: 129/302 cut-off events. [2024-06-03 22:49:10,113 INFO L125 PetriNetUnfolderBase]: For 4010/4010 co-relation queries the response was YES. [2024-06-03 22:49:10,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 302 events. 129/302 cut-off events. For 4010/4010 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1331 event pairs, 31 based on Foata normal form. 8/305 useless extension candidates. Maximal degree in co-relation 1231. Up to 157 conditions per place. [2024-06-03 22:49:10,115 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 38 selfloop transitions, 16 changer transitions 12/70 dead transitions. [2024-06-03 22:49:10,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 70 transitions, 619 flow [2024-06-03 22:49:10,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:49:10,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-03 22:49:10,121 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 437 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:49:10,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 70 transitions, 619 flow [2024-06-03 22:49:10,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 70 transitions, 573 flow, removed 1 selfloop flow, removed 8 redundant places. [2024-06-03 22:49:10,127 INFO L231 Difference]: Finished difference. Result has 87 places, 54 transitions, 389 flow [2024-06-03 22:49:10,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=389, PETRI_PLACES=87, PETRI_TRANSITIONS=54} [2024-06-03 22:49:10,127 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 57 predicate places. [2024-06-03 22:49:10,127 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 54 transitions, 389 flow [2024-06-03 22:49:10,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:10,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:10,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:10,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:49:10,128 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-03 22:49:10,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:10,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2058270101, now seen corresponding path program 4 times [2024-06-03 22:49:10,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:10,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470851337] [2024-06-03 22:49:10,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:14,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470851337] [2024-06-03 22:49:14,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470851337] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:14,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:14,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:14,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511351875] [2024-06-03 22:49:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:14,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:14,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:14,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:15,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:15,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 54 transitions, 389 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:15,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:15,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:15,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:15,276 INFO L124 PetriNetUnfolderBase]: 134/319 cut-off events. [2024-06-03 22:49:15,277 INFO L125 PetriNetUnfolderBase]: For 5094/5094 co-relation queries the response was YES. [2024-06-03 22:49:15,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 319 events. 134/319 cut-off events. For 5094/5094 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1427 event pairs, 39 based on Foata normal form. 6/320 useless extension candidates. Maximal degree in co-relation 1437. Up to 134 conditions per place. [2024-06-03 22:49:15,279 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 42 selfloop transitions, 16 changer transitions 6/68 dead transitions. [2024-06-03 22:49:15,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 68 transitions, 635 flow [2024-06-03 22:49:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:15,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:49:15,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-03 22:49:15,280 INFO L175 Difference]: Start difference. First operand has 87 places, 54 transitions, 389 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:49:15,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 68 transitions, 635 flow [2024-06-03 22:49:15,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 68 transitions, 585 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:49:15,286 INFO L231 Difference]: Finished difference. Result has 85 places, 52 transitions, 368 flow [2024-06-03 22:49:15,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=368, PETRI_PLACES=85, PETRI_TRANSITIONS=52} [2024-06-03 22:49:15,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 55 predicate places. [2024-06-03 22:49:15,287 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 52 transitions, 368 flow [2024-06-03 22:49:15,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:15,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:15,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:15,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:49:15,287 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-03 22:49:15,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1145659209, now seen corresponding path program 5 times [2024-06-03 22:49:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:15,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031023581] [2024-06-03 22:49:15,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:15,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031023581] [2024-06-03 22:49:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031023581] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875064268] [2024-06-03 22:49:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:19,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:19,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:19,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:19,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 52 transitions, 368 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:19,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:19,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:19,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:19,982 INFO L124 PetriNetUnfolderBase]: 110/270 cut-off events. [2024-06-03 22:49:19,982 INFO L125 PetriNetUnfolderBase]: For 3582/3582 co-relation queries the response was YES. [2024-06-03 22:49:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 270 events. 110/270 cut-off events. For 3582/3582 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1158 event pairs, 27 based on Foata normal form. 8/274 useless extension candidates. Maximal degree in co-relation 1062. Up to 149 conditions per place. [2024-06-03 22:49:19,984 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 37 selfloop transitions, 12 changer transitions 12/65 dead transitions. [2024-06-03 22:49:19,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 65 transitions, 546 flow [2024-06-03 22:49:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 22:49:19,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-03 22:49:19,986 INFO L175 Difference]: Start difference. First operand has 85 places, 52 transitions, 368 flow. Second operand 9 states and 118 transitions. [2024-06-03 22:49:19,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 65 transitions, 546 flow [2024-06-03 22:49:19,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 65 transitions, 505 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:49:19,992 INFO L231 Difference]: Finished difference. Result has 84 places, 47 transitions, 324 flow [2024-06-03 22:49:19,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=324, PETRI_PLACES=84, PETRI_TRANSITIONS=47} [2024-06-03 22:49:19,992 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-03 22:49:19,992 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 47 transitions, 324 flow [2024-06-03 22:49:19,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:19,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:19,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:19,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:49:19,993 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-03 22:49:19,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:19,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1394087497, now seen corresponding path program 6 times [2024-06-03 22:49:19,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:19,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548765348] [2024-06-03 22:49:19,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:24,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548765348] [2024-06-03 22:49:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548765348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:24,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:24,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552105064] [2024-06-03 22:49:24,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:24,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:24,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:24,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:24,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 47 transitions, 324 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:24,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:24,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:24,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:24,360 INFO L124 PetriNetUnfolderBase]: 118/279 cut-off events. [2024-06-03 22:49:24,360 INFO L125 PetriNetUnfolderBase]: For 4609/4609 co-relation queries the response was YES. [2024-06-03 22:49:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 279 events. 118/279 cut-off events. For 4609/4609 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1167 event pairs, 39 based on Foata normal form. 6/280 useless extension candidates. Maximal degree in co-relation 1247. Up to 105 conditions per place. [2024-06-03 22:49:24,362 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 36 selfloop transitions, 15 changer transitions 6/61 dead transitions. [2024-06-03 22:49:24,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 61 transitions, 548 flow [2024-06-03 22:49:24,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:24,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:24,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 118 transitions. [2024-06-03 22:49:24,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4229390681003584 [2024-06-03 22:49:24,364 INFO L175 Difference]: Start difference. First operand has 84 places, 47 transitions, 324 flow. Second operand 9 states and 118 transitions. [2024-06-03 22:49:24,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 61 transitions, 548 flow [2024-06-03 22:49:24,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 61 transitions, 478 flow, removed 16 selfloop flow, removed 10 redundant places. [2024-06-03 22:49:24,370 INFO L231 Difference]: Finished difference. Result has 77 places, 45 transitions, 292 flow [2024-06-03 22:49:24,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=292, PETRI_PLACES=77, PETRI_TRANSITIONS=45} [2024-06-03 22:49:24,370 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 47 predicate places. [2024-06-03 22:49:24,370 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 45 transitions, 292 flow [2024-06-03 22:49:24,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:24,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:24,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:49:24,371 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-03 22:49:24,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:24,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1393820587, now seen corresponding path program 7 times [2024-06-03 22:49:24,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:24,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652114264] [2024-06-03 22:49:24,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:24,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:29,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:29,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652114264] [2024-06-03 22:49:29,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652114264] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:29,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:29,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:29,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933102791] [2024-06-03 22:49:29,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:29,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:29,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:29,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:29,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 45 transitions, 292 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:29,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:29,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:29,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:30,058 INFO L124 PetriNetUnfolderBase]: 94/230 cut-off events. [2024-06-03 22:49:30,058 INFO L125 PetriNetUnfolderBase]: For 2783/2783 co-relation queries the response was YES. [2024-06-03 22:49:30,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 230 events. 94/230 cut-off events. For 2783/2783 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 909 event pairs, 27 based on Foata normal form. 8/234 useless extension candidates. Maximal degree in co-relation 846. Up to 120 conditions per place. [2024-06-03 22:49:30,060 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 31 selfloop transitions, 12 changer transitions 11/58 dead transitions. [2024-06-03 22:49:30,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 58 transitions, 448 flow [2024-06-03 22:49:30,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:30,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:30,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:49:30,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:49:30,061 INFO L175 Difference]: Start difference. First operand has 77 places, 45 transitions, 292 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:49:30,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 58 transitions, 448 flow [2024-06-03 22:49:30,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 58 transitions, 409 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-03 22:49:30,064 INFO L231 Difference]: Finished difference. Result has 76 places, 41 transitions, 257 flow [2024-06-03 22:49:30,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=257, PETRI_PLACES=76, PETRI_TRANSITIONS=41} [2024-06-03 22:49:30,064 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-03 22:49:30,065 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 41 transitions, 257 flow [2024-06-03 22:49:30,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:30,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:30,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:30,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:49:30,065 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-03 22:49:30,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1411689925, now seen corresponding path program 8 times [2024-06-03 22:49:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433536549] [2024-06-03 22:49:30,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:34,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:34,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433536549] [2024-06-03 22:49:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433536549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178765374] [2024-06-03 22:49:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:34,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:34,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:34,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 41 transitions, 257 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:34,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:34,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:34,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:34,698 INFO L124 PetriNetUnfolderBase]: 77/196 cut-off events. [2024-06-03 22:49:34,698 INFO L125 PetriNetUnfolderBase]: For 2014/2014 co-relation queries the response was YES. [2024-06-03 22:49:34,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 196 events. 77/196 cut-off events. For 2014/2014 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 700 event pairs, 22 based on Foata normal form. 6/197 useless extension candidates. Maximal degree in co-relation 673. Up to 74 conditions per place. [2024-06-03 22:49:34,699 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 23 selfloop transitions, 10 changer transitions 14/51 dead transitions. [2024-06-03 22:49:34,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 51 transitions, 371 flow [2024-06-03 22:49:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 22:49:34,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 22:49:34,700 INFO L175 Difference]: Start difference. First operand has 76 places, 41 transitions, 257 flow. Second operand 9 states and 109 transitions. [2024-06-03 22:49:34,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 51 transitions, 371 flow [2024-06-03 22:49:34,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 51 transitions, 331 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:49:34,704 INFO L231 Difference]: Finished difference. Result has 71 places, 35 transitions, 205 flow [2024-06-03 22:49:34,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=71, PETRI_TRANSITIONS=35} [2024-06-03 22:49:34,705 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 41 predicate places. [2024-06-03 22:49:34,705 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 35 transitions, 205 flow [2024-06-03 22:49:34,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:34,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:34,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:34,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:49:34,706 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-03 22:49:34,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1195187911, now seen corresponding path program 1 times [2024-06-03 22:49:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084155467] [2024-06-03 22:49:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:39,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:39,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084155467] [2024-06-03 22:49:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084155467] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947115565] [2024-06-03 22:49:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:39,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:39,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:49:39,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 35 transitions, 205 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:39,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:39,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:49:39,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:39,585 INFO L124 PetriNetUnfolderBase]: 69/172 cut-off events. [2024-06-03 22:49:39,585 INFO L125 PetriNetUnfolderBase]: For 1673/1673 co-relation queries the response was YES. [2024-06-03 22:49:39,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 172 events. 69/172 cut-off events. For 1673/1673 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 556 event pairs, 22 based on Foata normal form. 6/173 useless extension candidates. Maximal degree in co-relation 561. Up to 73 conditions per place. [2024-06-03 22:49:39,586 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 21 selfloop transitions, 7 changer transitions 14/46 dead transitions. [2024-06-03 22:49:39,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 46 transitions, 314 flow [2024-06-03 22:49:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:49:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:49:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:49:39,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-03 22:49:39,587 INFO L175 Difference]: Start difference. First operand has 71 places, 35 transitions, 205 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:49:39,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 46 transitions, 314 flow [2024-06-03 22:49:39,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 46 transitions, 280 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:49:39,590 INFO L231 Difference]: Finished difference. Result has 63 places, 30 transitions, 161 flow [2024-06-03 22:49:39,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=161, PETRI_PLACES=63, PETRI_TRANSITIONS=30} [2024-06-03 22:49:39,591 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 33 predicate places. [2024-06-03 22:49:39,591 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 30 transitions, 161 flow [2024-06-03 22:49:39,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:39,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:49:39,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:39,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:49:39,592 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-03 22:49:39,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:49:39,592 INFO L85 PathProgramCache]: Analyzing trace with hash 724154507, now seen corresponding path program 2 times [2024-06-03 22:49:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:49:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475207891] [2024-06-03 22:49:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:49:39,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:49:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:49:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:49:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:49:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475207891] [2024-06-03 22:49:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475207891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:49:44,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:49:44,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:49:44,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631208322] [2024-06-03 22:49:44,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:49:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:49:44,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:49:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:49:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:49:44,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:49:44,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 30 transitions, 161 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:44,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:49:44,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:49:44,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:49:44,727 INFO L124 PetriNetUnfolderBase]: 36/104 cut-off events. [2024-06-03 22:49:44,727 INFO L125 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2024-06-03 22:49:44,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 104 events. 36/104 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 272 event pairs, 3 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 286. Up to 24 conditions per place. [2024-06-03 22:49:44,727 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 0 selfloop transitions, 0 changer transitions 36/36 dead transitions. [2024-06-03 22:49:44,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 36 transitions, 211 flow [2024-06-03 22:49:44,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:49:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:49:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-03 22:49:44,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31899641577060933 [2024-06-03 22:49:44,728 INFO L175 Difference]: Start difference. First operand has 63 places, 30 transitions, 161 flow. Second operand 9 states and 89 transitions. [2024-06-03 22:49:44,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 36 transitions, 211 flow [2024-06-03 22:49:44,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 36 transitions, 171 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-06-03 22:49:44,730 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-03 22:49:44,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-03 22:49:44,730 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 20 predicate places. [2024-06-03 22:49:44,730 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-03 22:49:44,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:49:44,733 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:49:44,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:49:44,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:49:44,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:49:44,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:49:44,735 INFO L445 BasicCegarLoop]: Path program histogram: [8, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:49:44,738 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:49:44,738 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:49:44,741 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:49:44,741 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:49:44,742 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:49:44 BasicIcfg [2024-06-03 22:49:44,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:49:44,743 INFO L158 Benchmark]: Toolchain (without parser) took 173167.71ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 89.9MB in the beginning and 1.0GB in the end (delta: -942.1MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,743 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:49:44,743 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:49:44,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 857.73ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 115.1MB in the end (delta: -25.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.27ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 99.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,744 INFO L158 Benchmark]: Boogie Preprocessor took 138.65ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 93.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,744 INFO L158 Benchmark]: RCFGBuilder took 1272.36ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 54.6MB in the end (delta: 38.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,745 INFO L158 Benchmark]: TraceAbstraction took 170753.20ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 53.6MB in the beginning and 1.0GB in the end (delta: -978.4MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2024-06-03 22:49:44,746 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 79.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 857.73ms. Allocated memory is still 167.8MB. Free memory was 89.7MB in the beginning and 115.1MB in the end (delta: -25.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 138.27ms. Allocated memory is still 167.8MB. Free memory was 115.1MB in the beginning and 99.6MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.65ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 93.3MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1272.36ms. Allocated memory is still 167.8MB. Free memory was 93.3MB in the beginning and 54.6MB in the end (delta: 38.7MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. * TraceAbstraction took 170753.20ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 53.6MB in the beginning and 1.0GB in the end (delta: -978.4MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 806]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 807]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 49 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 170.6s, OverallIterations: 38, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1849 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1556 mSDsluCounter, 964 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 855 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8461 IncrementalHoareTripleChecker+Invalid, 8735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 109 mSDtfsCounter, 8461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=528occurred in iteration=25, InterpolantAutomatonStates: 279, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 154.8s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 551 ConstructedInterpolants, 0 QuantifiedInterpolants, 25356 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-03 22:49:44,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE