./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:43:34,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:43:34,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:43:34,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:43:34,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:43:34,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:43:34,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:43:34,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:43:34,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:43:34,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:43:34,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:43:34,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:43:34,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:43:34,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:43:34,617 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:43:34,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:43:34,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:43:34,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:43:34,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:43:34,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:43:34,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:43:34,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:43:34,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:43:34,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:43:34,620 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:43:34,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:43:34,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:43:34,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:43:34,621 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:43:34,621 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:43:34,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:43:34,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:43:34,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:43:34,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:43:34,623 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:43:34,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:43:34,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:43:34,623 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:43:34,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:43:34,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:43:34,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:43:34,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:43:34,855 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:43:34,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-03 22:43:35,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:43:35,931 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:43:35,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-03 22:43:35,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf30ce67f/29ec664f458a476595bf55ba661effc3/FLAG70ee01c2c [2024-06-03 22:43:35,956 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf30ce67f/29ec664f458a476595bf55ba661effc3 [2024-06-03 22:43:35,957 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:43:35,958 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:43:35,960 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/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-03 22:43:36,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:43:36,086 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:43:36,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:43:36,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:43:36,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:43:36,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:43:35" (1/2) ... [2024-06-03 22:43:36,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a2dd55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:36, skipping insertion in model container [2024-06-03 22:43:36,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:43:35" (1/2) ... [2024-06-03 22:43:36,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e7c4c6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:43:36, skipping insertion in model container [2024-06-03 22:43:36,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:36" (2/2) ... [2024-06-03 22:43:36,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a2dd55 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:43:36, skipping insertion in model container [2024-06-03 22:43:36,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:36" (2/2) ... [2024-06-03 22:43:36,096 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:43:36,143 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:43:36,144 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:43:36,145 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] (((((((((((((! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:43:36,145 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:43:36,145 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-03 22:43:36,182 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:43:36,467 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:43:36,481 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:43:36,680 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:43:36,733 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:43:36,733 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:43:36 WrapperNode [2024-06-03 22:43:36,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:43:36,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:43:36,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:43:36,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:43:36,740 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:43:36" (1/1) ... [2024-06-03 22:43:36,776 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:43:36" (1/1) ... [2024-06-03 22:43:36,828 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-03 22:43:36,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:43:36,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:43:36,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:43:36,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:43:36,837 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:43:36" (1/1) ... [2024-06-03 22:43:36,838 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:43:36" (1/1) ... [2024-06-03 22:43:36,855 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:43:36" (1/1) ... [2024-06-03 22:43:36,883 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:43:36,883 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:43:36" (1/1) ... [2024-06-03 22:43:36,884 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:43:36" (1/1) ... [2024-06-03 22:43:36,904 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:43:36" (1/1) ... [2024-06-03 22:43:36,906 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:43:36" (1/1) ... [2024-06-03 22:43:36,915 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:43:36" (1/1) ... [2024-06-03 22:43:36,919 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:43:36" (1/1) ... [2024-06-03 22:43:36,928 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:43:36,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:43:36,929 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:43:36,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:43:36,930 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:43:36" (1/1) ... [2024-06-03 22:43:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:43:36,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:43:36,952 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:43:36,961 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:43:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:43:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:43:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:43:36,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:43:36,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:43:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:43:36,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:43:36,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:43:36,990 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:43:37,109 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:43:37,112 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:43:37,679 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:43:37,679 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:43:37,825 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:43:37,826 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:43:37,827 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:43:37 BoogieIcfgContainer [2024-06-03 22:43:37,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:43:37,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:43:37,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:43:37,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:43:37,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:43:35" (1/4) ... [2024-06-03 22:43:37,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127db202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:43:37, skipping insertion in model container [2024-06-03 22:43:37,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:43:36" (2/4) ... [2024-06-03 22:43:37,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127db202 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:43:37, skipping insertion in model container [2024-06-03 22:43:37,833 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:43:36" (3/4) ... [2024-06-03 22:43:37,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@127db202 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:43:37, skipping insertion in model container [2024-06-03 22:43:37,834 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:43:37" (4/4) ... [2024-06-03 22:43:37,835 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-03 22:43:37,849 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:43:37,850 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:43:37,850 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:43:37,907 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:43:37,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:43:37,963 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-03 22:43:37,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:43:37,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:43:37,965 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-03 22:43:37,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-03 22:43:37,979 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:43:37,984 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;@41878d8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:43:37,985 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:43:37,997 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:43:37,997 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:43:37,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:43:37,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:37,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:43:37,999 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:43:38,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1350958641, now seen corresponding path program 1 times [2024-06-03 22:43:38,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:38,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514215484] [2024-06-03 22:43:38,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:38,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:40,528 INFO 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:43:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:40,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514215484] [2024-06-03 22:43:40,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514215484] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:40,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:40,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:43:40,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595652496] [2024-06-03 22:43:40,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:40,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:43:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:43:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:43:40,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:40,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:43:40,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:40,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:40,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:40,770 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-03 22:43:40,770 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:43:40,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 610 conditions, 297 events. 162/297 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1018 event pairs, 97 based on Foata normal form. 1/293 useless extension candidates. Maximal degree in co-relation 596. Up to 288 conditions per place. [2024-06-03 22:43:40,774 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-03 22:43:40,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-03 22:43:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:43:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:43:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-06-03 22:43:40,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-03 22:43:40,784 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 46 transitions. [2024-06-03 22:43:40,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-03 22:43:40,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:43:40,788 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-03 22:43:40,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-03 22:43:40,791 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-03 22:43:40,791 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-03 22:43:40,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states 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:43:40,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:40,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:40,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:43:40,792 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:43:40,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1191162640, now seen corresponding path program 1 times [2024-06-03 22:43:40,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:40,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45486851] [2024-06-03 22:43:40,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:42,336 INFO 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:43:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45486851] [2024-06-03 22:43:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45486851] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:42,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:42,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:43:42,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722525484] [2024-06-03 22:43:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:42,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:43:42,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:42,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:43:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:43:42,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:42,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:43:42,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:42,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:42,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:42,531 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-03 22:43:42,531 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 22:43:42,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 292 events. 159/292 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1009 event pairs, 79 based on Foata normal form. 2/294 useless extension candidates. Maximal degree in co-relation 667. Up to 274 conditions per place. [2024-06-03 22:43:42,533 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-03 22:43:42,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-03 22:43:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:43:42,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:43:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2024-06-03 22:43:42,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-03 22:43:42,535 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 58 transitions. [2024-06-03 22:43:42,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-03 22:43:42,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:43:42,536 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-03 22:43:42,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-03 22:43:42,537 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-03 22:43:42,537 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-03 22:43:42,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:43:42,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:42,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:42,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:43:42,538 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:43:42,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1728662762, now seen corresponding path program 1 times [2024-06-03 22:43:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:42,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78959129] [2024-06-03 22:43:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:43,936 INFO 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:43:43,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:43,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78959129] [2024-06-03 22:43:43,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78959129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:43,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:43,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:43:43,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794136320] [2024-06-03 22:43:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:43,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:43:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:43,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:43:43,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:43:43,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:43,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:43:43,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:43,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:43,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:44,170 INFO L124 PetriNetUnfolderBase]: 160/294 cut-off events. [2024-06-03 22:43:44,174 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-06-03 22:43:44,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 294 events. 160/294 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1016 event pairs, 56 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 744. Up to 248 conditions per place. [2024-06-03 22:43:44,178 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 35 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2024-06-03 22:43:44,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 251 flow [2024-06-03 22:43:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:43:44,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:43:44,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-03 22:43:44,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2024-06-03 22:43:44,182 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 76 transitions. [2024-06-03 22:43:44,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 251 flow [2024-06-03 22:43:44,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:43:44,185 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 160 flow [2024-06-03 22:43:44,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-03 22:43:44,186 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-03 22:43:44,187 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 160 flow [2024-06-03 22:43:44,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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:43:44,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:44,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:44,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:43:44,187 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:43:44,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2048936977, now seen corresponding path program 1 times [2024-06-03 22:43:44,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:44,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538782699] [2024-06-03 22:43:44,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:44,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:45,911 INFO 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:43:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:45,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538782699] [2024-06-03 22:43:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538782699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:45,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:45,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:43:45,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537944369] [2024-06-03 22:43:45,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:45,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:43:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:43:45,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:43:46,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:46,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:43:46,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:46,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:46,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:46,194 INFO L124 PetriNetUnfolderBase]: 179/326 cut-off events. [2024-06-03 22:43:46,195 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-06-03 22:43:46,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 326 events. 179/326 cut-off events. For 382/382 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1162 event pairs, 40 based on Foata normal form. 5/331 useless extension candidates. Maximal degree in co-relation 975. Up to 204 conditions per place. [2024-06-03 22:43:46,197 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 19 changer transitions 0/68 dead transitions. [2024-06-03 22:43:46,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 406 flow [2024-06-03 22:43:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:43:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:43:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-03 22:43:46,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-03 22:43:46,199 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 160 flow. Second operand 6 states and 98 transitions. [2024-06-03 22:43:46,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 406 flow [2024-06-03 22:43:46,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 402 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-03 22:43:46,201 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 275 flow [2024-06-03 22:43:46,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2024-06-03 22:43:46,202 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-03 22:43:46,202 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 275 flow [2024-06-03 22:43:46,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:43:46,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:46,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:46,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:43:46,203 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:43:46,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1764554869, now seen corresponding path program 1 times [2024-06-03 22:43:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037335329] [2024-06-03 22:43:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:48,069 INFO 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:43:48,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:48,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037335329] [2024-06-03 22:43:48,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037335329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:48,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:48,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:48,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309969809] [2024-06-03 22:43:48,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:48,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:48,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:48,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:48,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-03 22:43:48,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:43:48,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:48,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-03 22:43:48,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:48,333 INFO L124 PetriNetUnfolderBase]: 180/329 cut-off events. [2024-06-03 22:43:48,333 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2024-06-03 22:43:48,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 329 events. 180/329 cut-off events. For 692/692 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1178 event pairs, 27 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 1213. Up to 244 conditions per place. [2024-06-03 22:43:48,336 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 16 changer transitions 0/66 dead transitions. [2024-06-03 22:43:48,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 468 flow [2024-06-03 22:43:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:43:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:43:48,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-03 22:43:48,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-03 22:43:48,337 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 275 flow. Second operand 7 states and 97 transitions. [2024-06-03 22:43:48,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 468 flow [2024-06-03 22:43:48,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 456 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-03 22:43:48,341 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 309 flow [2024-06-03 22:43:48,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-03 22:43:48,342 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-03 22:43:48,342 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 309 flow [2024-06-03 22:43:48,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:43:48,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:48,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:48,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:43:48,343 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:43:48,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:48,343 INFO L85 PathProgramCache]: Analyzing trace with hash 288827368, now seen corresponding path program 1 times [2024-06-03 22:43:48,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:48,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465428933] [2024-06-03 22:43:48,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:48,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:51,385 INFO 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:43:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465428933] [2024-06-03 22:43:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465428933] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:51,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:43:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531872704] [2024-06-03 22:43:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:43:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:51,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:43:51,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:43:51,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:51,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 309 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:51,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:51,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:51,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:51,613 INFO L124 PetriNetUnfolderBase]: 178/326 cut-off events. [2024-06-03 22:43:51,614 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2024-06-03 22:43:51,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 326 events. 178/326 cut-off events. For 843/843 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1181 event pairs, 43 based on Foata normal form. 1/327 useless extension candidates. Maximal degree in co-relation 1306. Up to 314 conditions per place. [2024-06-03 22:43:51,617 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 43 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-03 22:43:51,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 419 flow [2024-06-03 22:43:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:43:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:43:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-03 22:43:51,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-03 22:43:51,620 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 309 flow. Second operand 5 states and 54 transitions. [2024-06-03 22:43:51,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 419 flow [2024-06-03 22:43:51,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 382 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-03 22:43:51,624 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 289 flow [2024-06-03 22:43:51,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-03 22:43:51,626 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-03 22:43:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 289 flow [2024-06-03 22:43:51,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:43:51,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:51,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:43:51,627 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:43:51,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 362820704, now seen corresponding path program 1 times [2024-06-03 22:43:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904504873] [2024-06-03 22:43:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:54,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:54,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904504873] [2024-06-03 22:43:54,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904504873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:54,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:54,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017815783] [2024-06-03 22:43:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:54,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:54,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:54,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:55,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:55,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 289 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:43:55,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:55,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:55,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:55,221 INFO L124 PetriNetUnfolderBase]: 174/320 cut-off events. [2024-06-03 22:43:55,221 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2024-06-03 22:43:55,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 320 events. 174/320 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1124 event pairs, 41 based on Foata normal form. 2/322 useless extension candidates. Maximal degree in co-relation 1244. Up to 302 conditions per place. [2024-06-03 22:43:55,223 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 43 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2024-06-03 22:43:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 407 flow [2024-06-03 22:43:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:43:55,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:43:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-06-03 22:43:55,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-03 22:43:55,225 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 289 flow. Second operand 6 states and 63 transitions. [2024-06-03 22:43:55,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 407 flow [2024-06-03 22:43:55,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 392 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:43:55,229 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 295 flow [2024-06-03 22:43:55,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-03 22:43:55,230 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-03 22:43:55,230 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 295 flow [2024-06-03 22:43:55,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:43:55,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:55,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:55,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:43:55,231 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:43:55,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1820617125, now seen corresponding path program 1 times [2024-06-03 22:43:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:55,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002647321] [2024-06-03 22:43:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:43:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:43:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:43:57,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002647321] [2024-06-03 22:43:57,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002647321] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:43:57,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:43:57,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:43:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420232405] [2024-06-03 22:43:57,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:43:57,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:43:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:43:57,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:43:57,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:43:57,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:43:57,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 295 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:43:57,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:43:57,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:43:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:43:58,162 INFO L124 PetriNetUnfolderBase]: 175/322 cut-off events. [2024-06-03 22:43:58,162 INFO L125 PetriNetUnfolderBase]: For 1068/1068 co-relation queries the response was YES. [2024-06-03 22:43:58,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 322 events. 175/322 cut-off events. For 1068/1068 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1151 event pairs, 38 based on Foata normal form. 2/324 useless extension candidates. Maximal degree in co-relation 1290. Up to 276 conditions per place. [2024-06-03 22:43:58,165 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 43 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2024-06-03 22:43:58,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 465 flow [2024-06-03 22:43:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:43:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:43:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-03 22:43:58,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-03 22:43:58,168 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 295 flow. Second operand 7 states and 77 transitions. [2024-06-03 22:43:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 465 flow [2024-06-03 22:43:58,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 439 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:43:58,171 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 322 flow [2024-06-03 22:43:58,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-06-03 22:43:58,177 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-03 22:43:58,177 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 322 flow [2024-06-03 22:43:58,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:43:58,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:43:58,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:43:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:43:58,178 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:43:58,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:43:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1826331045, now seen corresponding path program 2 times [2024-06-03 22:43:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:43:58,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396474913] [2024-06-03 22:43:58,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:43:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:43:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:00,833 INFO 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:44:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:00,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396474913] [2024-06-03 22:44:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396474913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:44:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392160264] [2024-06-03 22:44:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:44:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:00,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:44:00,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:44:00,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:00,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 322 flow. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:44:00,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:00,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:00,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:01,061 INFO L124 PetriNetUnfolderBase]: 170/312 cut-off events. [2024-06-03 22:44:01,061 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2024-06-03 22:44:01,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1310 conditions, 312 events. 170/312 cut-off events. For 1166/1166 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1101 event pairs, 38 based on Foata normal form. 1/313 useless extension candidates. Maximal degree in co-relation 1280. Up to 297 conditions per place. [2024-06-03 22:44:01,063 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-03 22:44:01,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 440 flow [2024-06-03 22:44:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:44:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:44:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2024-06-03 22:44:01,065 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-03 22:44:01,065 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 322 flow. Second operand 6 states and 62 transitions. [2024-06-03 22:44:01,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 440 flow [2024-06-03 22:44:01,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:01,067 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 326 flow [2024-06-03 22:44:01,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2024-06-03 22:44:01,068 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2024-06-03 22:44:01,068 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 326 flow [2024-06-03 22:44:01,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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:44:01,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:01,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:01,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:44:01,069 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:44:01,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash 604556645, now seen corresponding path program 1 times [2024-06-03 22:44:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:01,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252158377] [2024-06-03 22:44:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:03,871 INFO 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:44:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252158377] [2024-06-03 22:44:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252158377] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519054918] [2024-06-03 22:44:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:03,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:03,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:03,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:03,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 326 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:03,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:03,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:03,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:04,123 INFO L124 PetriNetUnfolderBase]: 190/346 cut-off events. [2024-06-03 22:44:04,123 INFO L125 PetriNetUnfolderBase]: For 1629/1629 co-relation queries the response was YES. [2024-06-03 22:44:04,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 346 events. 190/346 cut-off events. For 1629/1629 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1244 event pairs, 35 based on Foata normal form. 6/352 useless extension candidates. Maximal degree in co-relation 1401. Up to 195 conditions per place. [2024-06-03 22:44:04,125 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 45 selfloop transitions, 26 changer transitions 0/73 dead transitions. [2024-06-03 22:44:04,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 586 flow [2024-06-03 22:44:04,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:04,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:04,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-03 22:44:04,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:44:04,127 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 326 flow. Second operand 7 states and 90 transitions. [2024-06-03 22:44:04,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 586 flow [2024-06-03 22:44:04,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 552 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:04,130 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 416 flow [2024-06-03 22:44:04,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=416, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-03 22:44:04,132 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2024-06-03 22:44:04,134 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 416 flow [2024-06-03 22:44:04,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:04,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:04,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:44:04,134 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:44:04,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1637231969, now seen corresponding path program 2 times [2024-06-03 22:44:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23829316] [2024-06-03 22:44:04,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:06,796 INFO 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:44:06,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:06,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23829316] [2024-06-03 22:44:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23829316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:06,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:06,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312619983] [2024-06-03 22:44:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:06,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:06,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:06,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:06,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:06,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 416 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:06,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:06,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:06,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:07,049 INFO L124 PetriNetUnfolderBase]: 196/356 cut-off events. [2024-06-03 22:44:07,050 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2024-06-03 22:44:07,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 356 events. 196/356 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1291 event pairs, 38 based on Foata normal form. 2/358 useless extension candidates. Maximal degree in co-relation 1597. Up to 332 conditions per place. [2024-06-03 22:44:07,052 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-03 22:44:07,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 597 flow [2024-06-03 22:44:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-03 22:44:07,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2024-06-03 22:44:07,054 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 416 flow. Second operand 7 states and 72 transitions. [2024-06-03 22:44:07,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 597 flow [2024-06-03 22:44:07,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 581 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-03 22:44:07,057 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 467 flow [2024-06-03 22:44:07,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=467, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-06-03 22:44:07,058 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-03 22:44:07,058 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 467 flow [2024-06-03 22:44:07,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:07,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:07,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:07,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:44:07,058 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:44:07,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash 781688165, now seen corresponding path program 3 times [2024-06-03 22:44:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272923217] [2024-06-03 22:44:07,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:09,753 INFO 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:44:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272923217] [2024-06-03 22:44:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272923217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:09,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:09,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:09,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863593119] [2024-06-03 22:44:09,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:09,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:09,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:09,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:09,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:09,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:09,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 467 flow. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:09,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:09,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:09,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:10,031 INFO L124 PetriNetUnfolderBase]: 197/358 cut-off events. [2024-06-03 22:44:10,031 INFO L125 PetriNetUnfolderBase]: For 2116/2116 co-relation queries the response was YES. [2024-06-03 22:44:10,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1722 conditions, 358 events. 197/358 cut-off events. For 2116/2116 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1299 event pairs, 38 based on Foata normal form. 2/360 useless extension candidates. Maximal degree in co-relation 1686. Up to 321 conditions per place. [2024-06-03 22:44:10,034 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 55 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-03 22:44:10,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 679 flow [2024-06-03 22:44:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-03 22:44:10,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2024-06-03 22:44:10,035 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 467 flow. Second operand 7 states and 76 transitions. [2024-06-03 22:44:10,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 679 flow [2024-06-03 22:44:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 661 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:44:10,040 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 508 flow [2024-06-03 22:44:10,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2024-06-03 22:44:10,041 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2024-06-03 22:44:10,041 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 508 flow [2024-06-03 22:44:10,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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:44:10,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:10,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:44:10,042 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:44:10,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash 781934243, now seen corresponding path program 1 times [2024-06-03 22:44:10,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:10,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674793724] [2024-06-03 22:44:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:13,183 INFO 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:44:13,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:13,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674793724] [2024-06-03 22:44:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674793724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987090777] [2024-06-03 22:44:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:13,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:13,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:13,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:13,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:13,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 508 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:13,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:13,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:13,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:13,461 INFO L124 PetriNetUnfolderBase]: 194/353 cut-off events. [2024-06-03 22:44:13,461 INFO L125 PetriNetUnfolderBase]: For 2315/2315 co-relation queries the response was YES. [2024-06-03 22:44:13,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 353 events. 194/353 cut-off events. For 2315/2315 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1267 event pairs, 37 based on Foata normal form. 2/355 useless extension candidates. Maximal degree in co-relation 1688. Up to 329 conditions per place. [2024-06-03 22:44:13,463 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 59 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-06-03 22:44:13,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 664 flow [2024-06-03 22:44:13,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2024-06-03 22:44:13,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:44:13,465 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 508 flow. Second operand 7 states and 70 transitions. [2024-06-03 22:44:13,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 664 flow [2024-06-03 22:44:13,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 634 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-03 22:44:13,469 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 502 flow [2024-06-03 22:44:13,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-06-03 22:44:13,469 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-03 22:44:13,470 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 502 flow [2024-06-03 22:44:13,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:13,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:13,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:13,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:44:13,470 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:44:13,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1736925624, now seen corresponding path program 1 times [2024-06-03 22:44:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:13,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786706988] [2024-06-03 22:44:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:16,743 INFO 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:44:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786706988] [2024-06-03 22:44:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786706988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837467302] [2024-06-03 22:44:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:16,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:16,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 502 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:16,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:16,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:16,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:17,051 INFO L124 PetriNetUnfolderBase]: 190/346 cut-off events. [2024-06-03 22:44:17,051 INFO L125 PetriNetUnfolderBase]: For 2408/2408 co-relation queries the response was YES. [2024-06-03 22:44:17,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685 conditions, 346 events. 190/346 cut-off events. For 2408/2408 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1233 event pairs, 36 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 1647. Up to 285 conditions per place. [2024-06-03 22:44:17,053 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 58 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-03 22:44:17,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 699 flow [2024-06-03 22:44:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:44:17,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-03 22:44:17,055 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 502 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:44:17,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 699 flow [2024-06-03 22:44:17,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 79 transitions, 671 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:17,059 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 527 flow [2024-06-03 22:44:17,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=527, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2024-06-03 22:44:17,060 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-03 22:44:17,060 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 527 flow [2024-06-03 22:44:17,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:17,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:17,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:44:17,061 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:44:17,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:17,061 INFO L85 PathProgramCache]: Analyzing trace with hash 766473397, now seen corresponding path program 1 times [2024-06-03 22:44:17,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:17,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008051252] [2024-06-03 22:44:17,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:17,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:19,249 INFO 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:44:19,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:19,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008051252] [2024-06-03 22:44:19,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008051252] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:19,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:19,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:19,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151139371] [2024-06-03 22:44:19,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:19,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:19,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:19,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:19,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:19,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:19,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:19,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:19,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:19,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:19,512 INFO L124 PetriNetUnfolderBase]: 206/372 cut-off events. [2024-06-03 22:44:19,513 INFO L125 PetriNetUnfolderBase]: For 3061/3061 co-relation queries the response was YES. [2024-06-03 22:44:19,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 372 events. 206/372 cut-off events. For 3061/3061 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1356 event pairs, 34 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1804. Up to 195 conditions per place. [2024-06-03 22:44:19,515 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 47 selfloop transitions, 34 changer transitions 0/83 dead transitions. [2024-06-03 22:44:19,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 811 flow [2024-06-03 22:44:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-03 22:44:19,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-03 22:44:19,517 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 527 flow. Second operand 7 states and 87 transitions. [2024-06-03 22:44:19,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 811 flow [2024-06-03 22:44:19,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 769 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:19,522 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 587 flow [2024-06-03 22:44:19,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=587, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2024-06-03 22:44:19,523 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-03 22:44:19,523 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 587 flow [2024-06-03 22:44:19,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:19,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:19,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:19,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:44:19,523 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:44:19,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 766467817, now seen corresponding path program 2 times [2024-06-03 22:44:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534109968] [2024-06-03 22:44:19,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:19,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:21,779 INFO 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:44:21,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:21,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534109968] [2024-06-03 22:44:21,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534109968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:21,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003640093] [2024-06-03 22:44:21,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:21,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:21,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:21,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:21,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:21,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:21,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 587 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:21,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:21,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:21,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:22,014 INFO L124 PetriNetUnfolderBase]: 198/360 cut-off events. [2024-06-03 22:44:22,014 INFO L125 PetriNetUnfolderBase]: For 3361/3361 co-relation queries the response was YES. [2024-06-03 22:44:22,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 360 events. 198/360 cut-off events. For 3361/3361 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1307 event pairs, 32 based on Foata normal form. 4/364 useless extension candidates. Maximal degree in co-relation 1792. Up to 191 conditions per place. [2024-06-03 22:44:22,017 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 48 selfloop transitions, 36 changer transitions 0/86 dead transitions. [2024-06-03 22:44:22,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 863 flow [2024-06-03 22:44:22,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:22,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-03 22:44:22,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-03 22:44:22,019 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 587 flow. Second operand 7 states and 92 transitions. [2024-06-03 22:44:22,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 863 flow [2024-06-03 22:44:22,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 830 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-03 22:44:22,026 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 634 flow [2024-06-03 22:44:22,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=634, PETRI_PLACES=81, PETRI_TRANSITIONS=68} [2024-06-03 22:44:22,027 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-03 22:44:22,027 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 634 flow [2024-06-03 22:44:22,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:22,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:22,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:22,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:44:22,028 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:44:22,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -792565921, now seen corresponding path program 3 times [2024-06-03 22:44:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:22,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709338955] [2024-06-03 22:44:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:24,618 INFO 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:44:24,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:24,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709338955] [2024-06-03 22:44:24,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709338955] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:24,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:24,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:44:24,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892696] [2024-06-03 22:44:24,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:24,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:44:24,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:24,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:44:24,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:44:24,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:24,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 68 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:24,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:24,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:24,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:24,892 INFO L124 PetriNetUnfolderBase]: 198/360 cut-off events. [2024-06-03 22:44:24,892 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2024-06-03 22:44:24,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 360 events. 198/360 cut-off events. For 3501/3501 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1309 event pairs, 34 based on Foata normal form. 2/362 useless extension candidates. Maximal degree in co-relation 1846. Up to 328 conditions per place. [2024-06-03 22:44:24,895 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-03 22:44:24,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 834 flow [2024-06-03 22:44:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:24,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-03 22:44:24,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-03 22:44:24,896 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 634 flow. Second operand 8 states and 81 transitions. [2024-06-03 22:44:24,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 834 flow [2024-06-03 22:44:24,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 747 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:24,902 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 602 flow [2024-06-03 22:44:24,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=602, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2024-06-03 22:44:24,903 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-03 22:44:24,903 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 602 flow [2024-06-03 22:44:24,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 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:44:24,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:24,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:44:24,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:44:24,904 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:44:24,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1640715078, now seen corresponding path program 1 times [2024-06-03 22:44:24,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:24,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626769526] [2024-06-03 22:44:24,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:24,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:27,788 INFO 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:44:27,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:27,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626769526] [2024-06-03 22:44:27,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626769526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:27,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:27,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:27,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45392935] [2024-06-03 22:44:27,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:27,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:27,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:27,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:27,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:27,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:27,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 602 flow. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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:44:27,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:27,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:27,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:28,073 INFO L124 PetriNetUnfolderBase]: 196/357 cut-off events. [2024-06-03 22:44:28,074 INFO L125 PetriNetUnfolderBase]: For 3336/3336 co-relation queries the response was YES. [2024-06-03 22:44:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1812 conditions, 357 events. 196/357 cut-off events. For 3336/3336 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1296 event pairs, 33 based on Foata normal form. 1/358 useless extension candidates. Maximal degree in co-relation 1771. Up to 330 conditions per place. [2024-06-03 22:44:28,076 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2024-06-03 22:44:28,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 78 transitions, 774 flow [2024-06-03 22:44:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:44:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:44:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-03 22:44:28,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2024-06-03 22:44:28,079 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 602 flow. Second operand 7 states and 72 transitions. [2024-06-03 22:44:28,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 78 transitions, 774 flow [2024-06-03 22:44:28,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 741 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:28,088 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 603 flow [2024-06-03 22:44:28,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=603, PETRI_PLACES=84, PETRI_TRANSITIONS=70} [2024-06-03 22:44:28,088 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-03 22:44:28,089 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 603 flow [2024-06-03 22:44:28,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 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:44:28,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:28,089 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:44:28,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:44:28,089 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:44:28,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:28,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1040038856, now seen corresponding path program 1 times [2024-06-03 22:44:28,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:28,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794850657] [2024-06-03 22:44:28,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:28,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:31,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:44:31,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:31,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794850657] [2024-06-03 22:44:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794850657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590181809] [2024-06-03 22:44:31,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:31,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:31,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:31,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:31,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:31,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:31,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 70 transitions, 603 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:31,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:31,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:31,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:31,637 INFO L124 PetriNetUnfolderBase]: 229/424 cut-off events. [2024-06-03 22:44:31,638 INFO L125 PetriNetUnfolderBase]: For 5540/5540 co-relation queries the response was YES. [2024-06-03 22:44:31,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 424 events. 229/424 cut-off events. For 5540/5540 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1651 event pairs, 27 based on Foata normal form. 2/426 useless extension candidates. Maximal degree in co-relation 2148. Up to 153 conditions per place. [2024-06-03 22:44:31,641 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 35 changer transitions 0/97 dead transitions. [2024-06-03 22:44:31,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 97 transitions, 983 flow [2024-06-03 22:44:31,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:44:31,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-03 22:44:31,642 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 603 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:44:31,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 97 transitions, 983 flow [2024-06-03 22:44:31,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 935 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:44:31,650 INFO L231 Difference]: Finished difference. Result has 86 places, 71 transitions, 645 flow [2024-06-03 22:44:31,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=645, PETRI_PLACES=86, PETRI_TRANSITIONS=71} [2024-06-03 22:44:31,650 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:44:31,650 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 645 flow [2024-06-03 22:44:31,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:31,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:31,651 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:44:31,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:44:31,651 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:44:31,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:31,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2127393440, now seen corresponding path program 2 times [2024-06-03 22:44:31,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:31,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845777116] [2024-06-03 22:44:31,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:31,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:35,026 INFO 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:44:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845777116] [2024-06-03 22:44:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845777116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:35,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000649136] [2024-06-03 22:44:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:35,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:35,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:35,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:35,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:35,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 71 transitions, 645 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:35,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:35,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:35,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:35,318 INFO L124 PetriNetUnfolderBase]: 226/419 cut-off events. [2024-06-03 22:44:35,319 INFO L125 PetriNetUnfolderBase]: For 5339/5339 co-relation queries the response was YES. [2024-06-03 22:44:35,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 419 events. 226/419 cut-off events. For 5339/5339 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1640 event pairs, 55 based on Foata normal form. 2/421 useless extension candidates. Maximal degree in co-relation 2158. Up to 352 conditions per place. [2024-06-03 22:44:35,322 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-03 22:44:35,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 853 flow [2024-06-03 22:44:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:35,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-03 22:44:35,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592592592592593 [2024-06-03 22:44:35,323 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 645 flow. Second operand 9 states and 97 transitions. [2024-06-03 22:44:35,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 853 flow [2024-06-03 22:44:35,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 787 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:35,330 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 621 flow [2024-06-03 22:44:35,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=621, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2024-06-03 22:44:35,331 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:44:35,331 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 621 flow [2024-06-03 22:44:35,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:35,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:35,332 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:44:35,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:44:35,332 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:44:35,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:35,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1042900590, now seen corresponding path program 1 times [2024-06-03 22:44:35,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:35,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978203831] [2024-06-03 22:44:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:35,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:44:38,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:38,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978203831] [2024-06-03 22:44:38,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978203831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:38,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:38,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:38,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263737103] [2024-06-03 22:44:38,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:38,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:38,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:38,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:38,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 621 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:38,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:38,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:38,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:38,934 INFO L124 PetriNetUnfolderBase]: 222/413 cut-off events. [2024-06-03 22:44:38,935 INFO L125 PetriNetUnfolderBase]: For 5409/5409 co-relation queries the response was YES. [2024-06-03 22:44:38,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 413 events. 222/413 cut-off events. For 5409/5409 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1595 event pairs, 43 based on Foata normal form. 2/415 useless extension candidates. Maximal degree in co-relation 2085. Up to 250 conditions per place. [2024-06-03 22:44:38,938 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 51 selfloop transitions, 33 changer transitions 0/86 dead transitions. [2024-06-03 22:44:38,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 86 transitions, 867 flow [2024-06-03 22:44:38,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-03 22:44:38,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:44:38,939 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 621 flow. Second operand 8 states and 96 transitions. [2024-06-03 22:44:38,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 86 transitions, 867 flow [2024-06-03 22:44:38,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 814 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:44:38,947 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 639 flow [2024-06-03 22:44:38,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=639, PETRI_PLACES=89, PETRI_TRANSITIONS=71} [2024-06-03 22:44:38,947 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-03 22:44:38,948 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 639 flow [2024-06-03 22:44:38,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:38,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:38,948 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:44:38,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:44:38,948 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:44:38,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:38,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1913411342, now seen corresponding path program 1 times [2024-06-03 22:44:38,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:38,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53377086] [2024-06-03 22:44:38,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:38,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:41,957 INFO 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:44:41,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:41,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53377086] [2024-06-03 22:44:41,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53377086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:41,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:41,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:41,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270368875] [2024-06-03 22:44:41,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:41,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:41,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:41,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:41,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:42,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:42,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 71 transitions, 639 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:42,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:42,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:42,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:42,284 INFO L124 PetriNetUnfolderBase]: 217/406 cut-off events. [2024-06-03 22:44:42,284 INFO L125 PetriNetUnfolderBase]: For 6431/6431 co-relation queries the response was YES. [2024-06-03 22:44:42,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1946 conditions, 406 events. 217/406 cut-off events. For 6431/6431 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1604 event pairs, 31 based on Foata normal form. 14/420 useless extension candidates. Maximal degree in co-relation 1903. Up to 189 conditions per place. [2024-06-03 22:44:42,290 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 33 changer transitions 7/94 dead transitions. [2024-06-03 22:44:42,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 935 flow [2024-06-03 22:44:42,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:44:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:44:42,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 22:44:42,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-03 22:44:42,292 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 639 flow. Second operand 9 states and 109 transitions. [2024-06-03 22:44:42,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 935 flow [2024-06-03 22:44:42,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 94 transitions, 843 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:44:42,300 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 613 flow [2024-06-03 22:44:42,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=547, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=613, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2024-06-03 22:44:42,300 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:44:42,300 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 613 flow [2024-06-03 22:44:42,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:42,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:42,301 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:44:42,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:44:42,301 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:44:42,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 677210174, now seen corresponding path program 2 times [2024-06-03 22:44:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214339209] [2024-06-03 22:44:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:45,583 INFO 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:44:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214339209] [2024-06-03 22:44:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214339209] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:45,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163463907] [2024-06-03 22:44:45,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:45,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:45,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:45,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 613 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:45,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:45,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:45,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:45,860 INFO L124 PetriNetUnfolderBase]: 197/366 cut-off events. [2024-06-03 22:44:45,860 INFO L125 PetriNetUnfolderBase]: For 4364/4364 co-relation queries the response was YES. [2024-06-03 22:44:45,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 366 events. 197/366 cut-off events. For 4364/4364 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1378 event pairs, 31 based on Foata normal form. 2/368 useless extension candidates. Maximal degree in co-relation 1792. Up to 336 conditions per place. [2024-06-03 22:44:45,863 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2024-06-03 22:44:45,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 81 transitions, 803 flow [2024-06-03 22:44:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-03 22:44:45,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:44:45,864 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 613 flow. Second operand 8 states and 80 transitions. [2024-06-03 22:44:45,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 81 transitions, 803 flow [2024-06-03 22:44:45,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 716 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:44:45,871 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 566 flow [2024-06-03 22:44:45,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=566, PETRI_PLACES=90, PETRI_TRANSITIONS=71} [2024-06-03 22:44:45,871 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:44:45,872 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 566 flow [2024-06-03 22:44:45,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:45,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:45,872 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:44:45,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:44:45,872 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:44:45,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -180457406, now seen corresponding path program 3 times [2024-06-03 22:44:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479800586] [2024-06-03 22:44:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:48,753 INFO 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:44:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479800586] [2024-06-03 22:44:48,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479800586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:48,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:48,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:48,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465002005] [2024-06-03 22:44:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:48,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:48,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:48,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:48,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 71 transitions, 566 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:48,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:48,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:48,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:49,106 INFO L124 PetriNetUnfolderBase]: 201/374 cut-off events. [2024-06-03 22:44:49,106 INFO L125 PetriNetUnfolderBase]: For 4569/4569 co-relation queries the response was YES. [2024-06-03 22:44:49,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1811 conditions, 374 events. 201/374 cut-off events. For 4569/4569 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1416 event pairs, 31 based on Foata normal form. 2/376 useless extension candidates. Maximal degree in co-relation 1766. Up to 342 conditions per place. [2024-06-03 22:44:49,109 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 69 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-03 22:44:49,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 82 transitions, 758 flow [2024-06-03 22:44:49,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-03 22:44:49,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-03 22:44:49,110 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 566 flow. Second operand 8 states and 78 transitions. [2024-06-03 22:44:49,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 82 transitions, 758 flow [2024-06-03 22:44:49,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 82 transitions, 728 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:49,118 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 574 flow [2024-06-03 22:44:49,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=574, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2024-06-03 22:44:49,119 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-03 22:44:49,119 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 574 flow [2024-06-03 22:44:49,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:49,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:49,119 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:44:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:44:49,120 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:44:49,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 449309024, now seen corresponding path program 4 times [2024-06-03 22:44:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572959794] [2024-06-03 22:44:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:52,274 INFO 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:44:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:52,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572959794] [2024-06-03 22:44:52,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572959794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:52,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:52,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629176643] [2024-06-03 22:44:52,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:52,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:52,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:52,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 574 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:52,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:52,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:52,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:52,584 INFO L124 PetriNetUnfolderBase]: 205/382 cut-off events. [2024-06-03 22:44:52,584 INFO L125 PetriNetUnfolderBase]: For 5067/5067 co-relation queries the response was YES. [2024-06-03 22:44:52,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 382 events. 205/382 cut-off events. For 5067/5067 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1473 event pairs, 31 based on Foata normal form. 2/384 useless extension candidates. Maximal degree in co-relation 1813. Up to 340 conditions per place. [2024-06-03 22:44:52,587 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 65 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-06-03 22:44:52,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 84 transitions, 778 flow [2024-06-03 22:44:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-03 22:44:52,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-06-03 22:44:52,588 INFO L175 Difference]: Start difference. First operand has 92 places, 72 transitions, 574 flow. Second operand 8 states and 83 transitions. [2024-06-03 22:44:52,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 84 transitions, 778 flow [2024-06-03 22:44:52,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 750 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:52,596 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 598 flow [2024-06-03 22:44:52,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2024-06-03 22:44:52,597 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:44:52,597 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 598 flow [2024-06-03 22:44:52,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:52,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:52,598 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:44:52,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:44:52,598 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:44:52,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:52,598 INFO L85 PathProgramCache]: Analyzing trace with hash 685484136, now seen corresponding path program 1 times [2024-06-03 22:44:52,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:52,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062755805] [2024-06-03 22:44:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:52,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:55,602 INFO 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:44:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062755805] [2024-06-03 22:44:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062755805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:55,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:44:55,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639292305] [2024-06-03 22:44:55,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:55,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:44:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:55,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:44:55,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:44:55,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:55,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 598 flow. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:55,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:55,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:55,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:55,882 INFO L124 PetriNetUnfolderBase]: 202/377 cut-off events. [2024-06-03 22:44:55,882 INFO L125 PetriNetUnfolderBase]: For 4880/4880 co-relation queries the response was YES. [2024-06-03 22:44:55,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 377 events. 202/377 cut-off events. For 4880/4880 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1451 event pairs, 31 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 1792. Up to 339 conditions per place. [2024-06-03 22:44:55,884 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2024-06-03 22:44:55,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 83 transitions, 786 flow [2024-06-03 22:44:55,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:55,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:55,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-03 22:44:55,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-03 22:44:55,886 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 598 flow. Second operand 8 states and 81 transitions. [2024-06-03 22:44:55,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 83 transitions, 786 flow [2024-06-03 22:44:55,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 83 transitions, 744 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-03 22:44:55,895 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 598 flow [2024-06-03 22:44:55,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=598, PETRI_PLACES=96, PETRI_TRANSITIONS=73} [2024-06-03 22:44:55,895 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-03 22:44:55,895 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 598 flow [2024-06-03 22:44:55,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:44:55,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:55,896 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:44:55,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:44:55,896 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:44:55,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:55,896 INFO L85 PathProgramCache]: Analyzing trace with hash 685484384, now seen corresponding path program 5 times [2024-06-03 22:44:55,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:55,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918985867] [2024-06-03 22:44:55,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:55,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:44:59,020 INFO 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:44:59,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:44:59,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918985867] [2024-06-03 22:44:59,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918985867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:44:59,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:44:59,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:44:59,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214735897] [2024-06-03 22:44:59,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:44:59,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:44:59,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:44:59,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:44:59,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:44:59,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:44:59,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 73 transitions, 598 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:59,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:44:59,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:44:59,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:44:59,344 INFO L124 PetriNetUnfolderBase]: 199/372 cut-off events. [2024-06-03 22:44:59,344 INFO L125 PetriNetUnfolderBase]: For 4921/4921 co-relation queries the response was YES. [2024-06-03 22:44:59,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1772 conditions, 372 events. 199/372 cut-off events. For 4921/4921 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1423 event pairs, 30 based on Foata normal form. 2/374 useless extension candidates. Maximal degree in co-relation 1724. Up to 333 conditions per place. [2024-06-03 22:44:59,346 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 66 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2024-06-03 22:44:59,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 83 transitions, 784 flow [2024-06-03 22:44:59,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:44:59,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:44:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-03 22:44:59,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:44:59,347 INFO L175 Difference]: Start difference. First operand has 96 places, 73 transitions, 598 flow. Second operand 8 states and 80 transitions. [2024-06-03 22:44:59,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 83 transitions, 784 flow [2024-06-03 22:44:59,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 83 transitions, 704 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:44:59,356 INFO L231 Difference]: Finished difference. Result has 95 places, 73 transitions, 554 flow [2024-06-03 22:44:59,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=554, PETRI_PLACES=95, PETRI_TRANSITIONS=73} [2024-06-03 22:44:59,357 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-03 22:44:59,357 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 554 flow [2024-06-03 22:44:59,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:44:59,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:44:59,357 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:44:59,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:44:59,357 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:44:59,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:44:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1526560532, now seen corresponding path program 1 times [2024-06-03 22:44:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:44:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992028099] [2024-06-03 22:44:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:44:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:44:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:02,564 INFO 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:45:02,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992028099] [2024-06-03 22:45:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992028099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131079311] [2024-06-03 22:45:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:02,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:02,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:02,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 73 transitions, 554 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:02,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:02,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:02,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:02,980 INFO L124 PetriNetUnfolderBase]: 233/446 cut-off events. [2024-06-03 22:45:02,980 INFO L125 PetriNetUnfolderBase]: For 9227/9227 co-relation queries the response was YES. [2024-06-03 22:45:02,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2095 conditions, 446 events. 233/446 cut-off events. For 9227/9227 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1819 event pairs, 44 based on Foata normal form. 8/454 useless extension candidates. Maximal degree in co-relation 2047. Up to 186 conditions per place. [2024-06-03 22:45:02,983 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 31 changer transitions 12/101 dead transitions. [2024-06-03 22:45:02,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 882 flow [2024-06-03 22:45:02,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-03 22:45:02,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-03 22:45:02,984 INFO L175 Difference]: Start difference. First operand has 95 places, 73 transitions, 554 flow. Second operand 10 states and 115 transitions. [2024-06-03 22:45:02,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 882 flow [2024-06-03 22:45:02,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 824 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:02,992 INFO L231 Difference]: Finished difference. Result has 98 places, 71 transitions, 552 flow [2024-06-03 22:45:02,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=552, PETRI_PLACES=98, PETRI_TRANSITIONS=71} [2024-06-03 22:45:02,993 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:45:02,993 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 71 transitions, 552 flow [2024-06-03 22:45:02,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:02,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:02,993 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:45:02,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:45:02,993 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:45:02,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1524686582, now seen corresponding path program 2 times [2024-06-03 22:45:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010486098] [2024-06-03 22:45:02,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:02,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010486098] [2024-06-03 22:45:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010486098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:06,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:06,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:06,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778893251] [2024-06-03 22:45:06,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:06,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:06,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:06,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:06,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:06,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:06,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 71 transitions, 552 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:06,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:06,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:06,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:06,455 INFO L124 PetriNetUnfolderBase]: 254/493 cut-off events. [2024-06-03 22:45:06,455 INFO L125 PetriNetUnfolderBase]: For 12414/12414 co-relation queries the response was YES. [2024-06-03 22:45:06,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2454 conditions, 493 events. 254/493 cut-off events. For 12414/12414 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2090 event pairs, 58 based on Foata normal form. 8/501 useless extension candidates. Maximal degree in co-relation 2406. Up to 219 conditions per place. [2024-06-03 22:45:06,458 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 51 selfloop transitions, 33 changer transitions 15/101 dead transitions. [2024-06-03 22:45:06,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 890 flow [2024-06-03 22:45:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:06,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:45:06,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-03 22:45:06,460 INFO L175 Difference]: Start difference. First operand has 98 places, 71 transitions, 552 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:45:06,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 890 flow [2024-06-03 22:45:06,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 851 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:06,470 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 555 flow [2024-06-03 22:45:06,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=555, PETRI_PLACES=98, PETRI_TRANSITIONS=67} [2024-06-03 22:45:06,471 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-03 22:45:06,471 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 555 flow [2024-06-03 22:45:06,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:06,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:06,471 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:45:06,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:45:06,472 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:45:06,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2029819584, now seen corresponding path program 3 times [2024-06-03 22:45:06,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:06,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318135905] [2024-06-03 22:45:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:06,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:09,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318135905] [2024-06-03 22:45:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318135905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:09,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:09,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890608954] [2024-06-03 22:45:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:09,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:09,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:09,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:09,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:10,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:10,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 67 transitions, 555 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:10,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:10,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:10,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:10,383 INFO L124 PetriNetUnfolderBase]: 235/460 cut-off events. [2024-06-03 22:45:10,383 INFO L125 PetriNetUnfolderBase]: For 10839/10839 co-relation queries the response was YES. [2024-06-03 22:45:10,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2303 conditions, 460 events. 235/460 cut-off events. For 10839/10839 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1930 event pairs, 57 based on Foata normal form. 10/470 useless extension candidates. Maximal degree in co-relation 2256. Up to 256 conditions per place. [2024-06-03 22:45:10,386 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 46 selfloop transitions, 28 changer transitions 12/88 dead transitions. [2024-06-03 22:45:10,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 789 flow [2024-06-03 22:45:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:10,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-03 22:45:10,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37 [2024-06-03 22:45:10,389 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 555 flow. Second operand 10 states and 111 transitions. [2024-06-03 22:45:10,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 789 flow [2024-06-03 22:45:10,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 714 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-03 22:45:10,397 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 522 flow [2024-06-03 22:45:10,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=522, PETRI_PLACES=94, PETRI_TRANSITIONS=64} [2024-06-03 22:45:10,398 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:45:10,398 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 522 flow [2024-06-03 22:45:10,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:10,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:10,398 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:45:10,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:45:10,398 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:45:10,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:10,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1544058816, now seen corresponding path program 4 times [2024-06-03 22:45:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820128240] [2024-06-03 22:45:10,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:13,527 INFO 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:45:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820128240] [2024-06-03 22:45:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820128240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:13,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:13,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:13,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577563530] [2024-06-03 22:45:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:13,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:13,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:13,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 64 transitions, 522 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:13,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:13,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:13,937 INFO L124 PetriNetUnfolderBase]: 228/451 cut-off events. [2024-06-03 22:45:13,938 INFO L125 PetriNetUnfolderBase]: For 9038/9038 co-relation queries the response was YES. [2024-06-03 22:45:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 451 events. 228/451 cut-off events. For 9038/9038 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1880 event pairs, 52 based on Foata normal form. 8/459 useless extension candidates. Maximal degree in co-relation 2185. Up to 161 conditions per place. [2024-06-03 22:45:13,940 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 50 selfloop transitions, 28 changer transitions 10/90 dead transitions. [2024-06-03 22:45:13,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 90 transitions, 818 flow [2024-06-03 22:45:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:13,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-03 22:45:13,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-03 22:45:13,942 INFO L175 Difference]: Start difference. First operand has 94 places, 64 transitions, 522 flow. Second operand 9 states and 105 transitions. [2024-06-03 22:45:13,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 90 transitions, 818 flow [2024-06-03 22:45:13,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 751 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-03 22:45:13,949 INFO L231 Difference]: Finished difference. Result has 91 places, 62 transitions, 501 flow [2024-06-03 22:45:13,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=501, PETRI_PLACES=91, PETRI_TRANSITIONS=62} [2024-06-03 22:45:13,950 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-03 22:45:13,950 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 62 transitions, 501 flow [2024-06-03 22:45:13,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:13,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:13,950 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:45:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:45:13,951 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:45:13,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:13,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1544062536, now seen corresponding path program 5 times [2024-06-03 22:45:13,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868242146] [2024-06-03 22:45:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:17,080 INFO 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:45:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868242146] [2024-06-03 22:45:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868242146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:17,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:17,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319156850] [2024-06-03 22:45:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:17,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:17,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:17,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 62 transitions, 501 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:17,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:17,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:17,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:17,465 INFO L124 PetriNetUnfolderBase]: 222/439 cut-off events. [2024-06-03 22:45:17,465 INFO L125 PetriNetUnfolderBase]: For 9217/9217 co-relation queries the response was YES. [2024-06-03 22:45:17,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 439 events. 222/439 cut-off events. For 9217/9217 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1853 event pairs, 54 based on Foata normal form. 12/451 useless extension candidates. Maximal degree in co-relation 2087. Up to 249 conditions per place. [2024-06-03 22:45:17,468 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 44 selfloop transitions, 29 changer transitions 8/83 dead transitions. [2024-06-03 22:45:17,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 83 transitions, 729 flow [2024-06-03 22:45:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 22:45:17,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-03 22:45:17,470 INFO L175 Difference]: Start difference. First operand has 91 places, 62 transitions, 501 flow. Second operand 9 states and 102 transitions. [2024-06-03 22:45:17,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 83 transitions, 729 flow [2024-06-03 22:45:17,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 83 transitions, 677 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:45:17,480 INFO L231 Difference]: Finished difference. Result has 90 places, 59 transitions, 482 flow [2024-06-03 22:45:17,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=90, PETRI_TRANSITIONS=59} [2024-06-03 22:45:17,481 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:45:17,482 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 59 transitions, 482 flow [2024-06-03 22:45:17,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:17,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:17,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:45:17,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:45:17,482 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:45:17,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2136179368, now seen corresponding path program 6 times [2024-06-03 22:45:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855325655] [2024-06-03 22:45:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:20,505 INFO 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:45:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:20,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855325655] [2024-06-03 22:45:20,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855325655] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:20,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:20,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124605853] [2024-06-03 22:45:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:20,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:20,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:20,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 59 transitions, 482 flow. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:20,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:20,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:20,847 INFO L124 PetriNetUnfolderBase]: 195/389 cut-off events. [2024-06-03 22:45:20,848 INFO L125 PetriNetUnfolderBase]: For 7052/7052 co-relation queries the response was YES. [2024-06-03 22:45:20,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 389 events. 195/389 cut-off events. For 7052/7052 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1565 event pairs, 57 based on Foata normal form. 10/399 useless extension candidates. Maximal degree in co-relation 1841. Up to 223 conditions per place. [2024-06-03 22:45:20,850 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 37 selfloop transitions, 23 changer transitions 14/76 dead transitions. [2024-06-03 22:45:20,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 76 transitions, 678 flow [2024-06-03 22:45:20,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-03 22:45:20,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-03 22:45:20,851 INFO L175 Difference]: Start difference. First operand has 90 places, 59 transitions, 482 flow. Second operand 8 states and 90 transitions. [2024-06-03 22:45:20,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 76 transitions, 678 flow [2024-06-03 22:45:20,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 594 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:45:20,857 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 396 flow [2024-06-03 22:45:20,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=396, PETRI_PLACES=87, PETRI_TRANSITIONS=52} [2024-06-03 22:45:20,858 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-03 22:45:20,858 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 396 flow [2024-06-03 22:45:20,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:20,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:20,859 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:45:20,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:45:20,859 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:45:20,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1506788318, now seen corresponding path program 1 times [2024-06-03 22:45:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966707717] [2024-06-03 22:45:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:24,189 INFO 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:45:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966707717] [2024-06-03 22:45:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966707717] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:24,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:24,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121518506] [2024-06-03 22:45:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:24,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:24,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:24,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:24,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 52 transitions, 396 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:24,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:24,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:24,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:24,553 INFO L124 PetriNetUnfolderBase]: 163/337 cut-off events. [2024-06-03 22:45:24,553 INFO L125 PetriNetUnfolderBase]: For 5916/5916 co-relation queries the response was YES. [2024-06-03 22:45:24,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 337 events. 163/337 cut-off events. For 5916/5916 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1333 event pairs, 52 based on Foata normal form. 2/339 useless extension candidates. Maximal degree in co-relation 1622. Up to 225 conditions per place. [2024-06-03 22:45:24,555 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 41 selfloop transitions, 22 changer transitions 0/65 dead transitions. [2024-06-03 22:45:24,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 65 transitions, 560 flow [2024-06-03 22:45:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-03 22:45:24,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32592592592592595 [2024-06-03 22:45:24,556 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 396 flow. Second operand 9 states and 88 transitions. [2024-06-03 22:45:24,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 65 transitions, 560 flow [2024-06-03 22:45:24,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 65 transitions, 500 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:24,562 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 394 flow [2024-06-03 22:45:24,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=86, PETRI_TRANSITIONS=53} [2024-06-03 22:45:24,562 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-03 22:45:24,562 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 394 flow [2024-06-03 22:45:24,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:24,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:24,563 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:45:24,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:45:24,563 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:45:24,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:24,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1506780878, now seen corresponding path program 2 times [2024-06-03 22:45:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34265185] [2024-06-03 22:45:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:27,775 INFO 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:45:27,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:27,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34265185] [2024-06-03 22:45:27,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34265185] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:27,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:27,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:27,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029201816] [2024-06-03 22:45:27,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:27,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:27,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:27,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:27,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:27,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:27,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 53 transitions, 394 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:27,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:27,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:27,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:28,082 INFO L124 PetriNetUnfolderBase]: 167/345 cut-off events. [2024-06-03 22:45:28,083 INFO L125 PetriNetUnfolderBase]: For 5906/5906 co-relation queries the response was YES. [2024-06-03 22:45:28,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 345 events. 167/345 cut-off events. For 5906/5906 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1377 event pairs, 50 based on Foata normal form. 2/347 useless extension candidates. Maximal degree in co-relation 1635. Up to 197 conditions per place. [2024-06-03 22:45:28,084 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 39 selfloop transitions, 25 changer transitions 0/66 dead transitions. [2024-06-03 22:45:28,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 66 transitions, 560 flow [2024-06-03 22:45:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-03 22:45:28,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3296296296296296 [2024-06-03 22:45:28,085 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 394 flow. Second operand 9 states and 89 transitions. [2024-06-03 22:45:28,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 66 transitions, 560 flow [2024-06-03 22:45:28,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 66 transitions, 512 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:28,092 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 413 flow [2024-06-03 22:45:28,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=413, PETRI_PLACES=88, PETRI_TRANSITIONS=54} [2024-06-03 22:45:28,093 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-03 22:45:28,093 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 413 flow [2024-06-03 22:45:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:28,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:28,093 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:45:28,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:45:28,093 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:45:28,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1244767538, now seen corresponding path program 3 times [2024-06-03 22:45:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:28,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760935934] [2024-06-03 22:45:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:31,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:45:31,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:31,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760935934] [2024-06-03 22:45:31,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760935934] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:31,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:31,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279856826] [2024-06-03 22:45:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:31,642 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:31,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 54 transitions, 413 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:31,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:31,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:31,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:31,837 INFO L124 PetriNetUnfolderBase]: 164/340 cut-off events. [2024-06-03 22:45:31,837 INFO L125 PetriNetUnfolderBase]: For 5996/5996 co-relation queries the response was YES. [2024-06-03 22:45:31,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 340 events. 164/340 cut-off events. For 5996/5996 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1348 event pairs, 53 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1619. Up to 267 conditions per place. [2024-06-03 22:45:31,839 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 50 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2024-06-03 22:45:31,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 69 transitions, 645 flow [2024-06-03 22:45:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:31,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-03 22:45:31,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-03 22:45:31,839 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 413 flow. Second operand 9 states and 90 transitions. [2024-06-03 22:45:31,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 69 transitions, 645 flow [2024-06-03 22:45:31,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 590 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:31,847 INFO L231 Difference]: Finished difference. Result has 90 places, 56 transitions, 423 flow [2024-06-03 22:45:31,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=81, 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=423, PETRI_PLACES=90, PETRI_TRANSITIONS=56} [2024-06-03 22:45:31,848 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-03 22:45:31,848 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 56 transitions, 423 flow [2024-06-03 22:45:31,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:31,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:31,848 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:45:31,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:45:31,848 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:45:31,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:31,849 INFO L85 PathProgramCache]: Analyzing trace with hash -215623374, now seen corresponding path program 4 times [2024-06-03 22:45:31,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:31,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386063576] [2024-06-03 22:45:31,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:31,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:34,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:34,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:34,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386063576] [2024-06-03 22:45:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386063576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:34,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:34,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:34,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069161064] [2024-06-03 22:45:34,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:34,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:34,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:34,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:34,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:35,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:35,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 56 transitions, 423 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:35,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:35,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:35,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:35,230 INFO L124 PetriNetUnfolderBase]: 161/335 cut-off events. [2024-06-03 22:45:35,230 INFO L125 PetriNetUnfolderBase]: For 6017/6017 co-relation queries the response was YES. [2024-06-03 22:45:35,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 335 events. 161/335 cut-off events. For 6017/6017 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1311 event pairs, 39 based on Foata normal form. 2/337 useless extension candidates. Maximal degree in co-relation 1553. Up to 295 conditions per place. [2024-06-03 22:45:35,232 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2024-06-03 22:45:35,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 68 transitions, 581 flow [2024-06-03 22:45:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:35,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-03 22:45:35,232 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2024-06-03 22:45:35,233 INFO L175 Difference]: Start difference. First operand has 90 places, 56 transitions, 423 flow. Second operand 9 states and 86 transitions. [2024-06-03 22:45:35,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 68 transitions, 581 flow [2024-06-03 22:45:35,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 68 transitions, 551 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:45:35,240 INFO L231 Difference]: Finished difference. Result has 94 places, 56 transitions, 421 flow [2024-06-03 22:45:35,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=421, PETRI_PLACES=94, PETRI_TRANSITIONS=56} [2024-06-03 22:45:35,240 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:45:35,240 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 56 transitions, 421 flow [2024-06-03 22:45:35,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:35,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:35,241 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:45:35,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:45:35,241 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:45:35,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:35,241 INFO L85 PathProgramCache]: Analyzing trace with hash -224827584, now seen corresponding path program 5 times [2024-06-03 22:45:35,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:35,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871558785] [2024-06-03 22:45:35,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:35,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:38,301 INFO 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:45:38,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:38,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871558785] [2024-06-03 22:45:38,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871558785] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:38,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:38,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:38,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162620042] [2024-06-03 22:45:38,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:38,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:38,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:38,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:38,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:38,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 56 transitions, 421 flow. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:38,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:38,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:38,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:38,580 INFO L124 PetriNetUnfolderBase]: 158/330 cut-off events. [2024-06-03 22:45:38,580 INFO L125 PetriNetUnfolderBase]: For 5899/5899 co-relation queries the response was YES. [2024-06-03 22:45:38,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 330 events. 158/330 cut-off events. For 5899/5899 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1295 event pairs, 50 based on Foata normal form. 2/332 useless extension candidates. Maximal degree in co-relation 1504. Up to 284 conditions per place. [2024-06-03 22:45:38,581 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 50 selfloop transitions, 15 changer transitions 0/67 dead transitions. [2024-06-03 22:45:38,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 67 transitions, 579 flow [2024-06-03 22:45:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:45:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:45:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-03 22:45:38,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-03 22:45:38,582 INFO L175 Difference]: Start difference. First operand has 94 places, 56 transitions, 421 flow. Second operand 8 states and 81 transitions. [2024-06-03 22:45:38,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 67 transitions, 579 flow [2024-06-03 22:45:38,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 67 transitions, 521 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:45:38,590 INFO L231 Difference]: Finished difference. Result has 93 places, 56 transitions, 398 flow [2024-06-03 22:45:38,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=398, PETRI_PLACES=93, PETRI_TRANSITIONS=56} [2024-06-03 22:45:38,591 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-03 22:45:38,591 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 56 transitions, 398 flow [2024-06-03 22:45:38,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states 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:45:38,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:38,591 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:45:38,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:45:38,591 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:38,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1623396027, now seen corresponding path program 1 times [2024-06-03 22:45:38,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:38,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670021753] [2024-06-03 22:45:38,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:38,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:41,845 INFO 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:45:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670021753] [2024-06-03 22:45:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670021753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514740276] [2024-06-03 22:45:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:41,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:41,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:41,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:41,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 56 transitions, 398 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:41,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:41,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:41,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:42,089 INFO L124 PetriNetUnfolderBase]: 196/418 cut-off events. [2024-06-03 22:45:42,089 INFO L125 PetriNetUnfolderBase]: For 7750/7750 co-relation queries the response was YES. [2024-06-03 22:45:42,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 418 events. 196/418 cut-off events. For 7750/7750 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1833 event pairs, 90 based on Foata normal form. 6/424 useless extension candidates. Maximal degree in co-relation 1725. Up to 282 conditions per place. [2024-06-03 22:45:42,091 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 21 changer transitions 7/84 dead transitions. [2024-06-03 22:45:42,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 84 transitions, 685 flow [2024-06-03 22:45:42,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-03 22:45:42,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2024-06-03 22:45:42,092 INFO L175 Difference]: Start difference. First operand has 93 places, 56 transitions, 398 flow. Second operand 9 states and 95 transitions. [2024-06-03 22:45:42,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 84 transitions, 685 flow [2024-06-03 22:45:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 84 transitions, 649 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-03 22:45:42,101 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 506 flow [2024-06-03 22:45:42,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=506, PETRI_PLACES=99, PETRI_TRANSITIONS=65} [2024-06-03 22:45:42,101 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-03 22:45:42,101 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 506 flow [2024-06-03 22:45:42,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:42,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:42,102 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:45:42,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:45:42,102 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:42,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1705764937, now seen corresponding path program 2 times [2024-06-03 22:45:42,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:42,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192240396] [2024-06-03 22:45:42,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:42,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:45,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:45,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192240396] [2024-06-03 22:45:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192240396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:45,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:45,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920798555] [2024-06-03 22:45:45,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:45,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:45,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:45,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:45,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:45,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 65 transitions, 506 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:45,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:45,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:45,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:45,880 INFO L124 PetriNetUnfolderBase]: 187/399 cut-off events. [2024-06-03 22:45:45,881 INFO L125 PetriNetUnfolderBase]: For 8477/8477 co-relation queries the response was YES. [2024-06-03 22:45:45,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 399 events. 187/399 cut-off events. For 8477/8477 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1720 event pairs, 57 based on Foata normal form. 6/405 useless extension candidates. Maximal degree in co-relation 1749. Up to 222 conditions per place. [2024-06-03 22:45:45,882 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 24 changer transitions 8/83 dead transitions. [2024-06-03 22:45:45,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 83 transitions, 726 flow [2024-06-03 22:45:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:45,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-03 22:45:45,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-03 22:45:45,883 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 506 flow. Second operand 9 states and 96 transitions. [2024-06-03 22:45:45,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 83 transitions, 726 flow [2024-06-03 22:45:45,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 83 transitions, 709 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-03 22:45:45,893 INFO L231 Difference]: Finished difference. Result has 104 places, 62 transitions, 521 flow [2024-06-03 22:45:45,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=521, PETRI_PLACES=104, PETRI_TRANSITIONS=62} [2024-06-03 22:45:45,894 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-03 22:45:45,894 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 62 transitions, 521 flow [2024-06-03 22:45:45,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:45,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:45,894 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:45:45,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:45:45,895 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:45,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1659216959, now seen corresponding path program 3 times [2024-06-03 22:45:45,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:45,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819958486] [2024-06-03 22:45:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:49,491 INFO 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:45:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819958486] [2024-06-03 22:45:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819958486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:49,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832428102] [2024-06-03 22:45:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:49,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:49,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:49,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:49,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:49,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 62 transitions, 521 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:49,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:49,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:49,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:49,778 INFO L124 PetriNetUnfolderBase]: 180/381 cut-off events. [2024-06-03 22:45:49,778 INFO L125 PetriNetUnfolderBase]: For 8568/8568 co-relation queries the response was YES. [2024-06-03 22:45:49,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 381 events. 180/381 cut-off events. For 8568/8568 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1609 event pairs, 51 based on Foata normal form. 6/387 useless extension candidates. Maximal degree in co-relation 1699. Up to 294 conditions per place. [2024-06-03 22:45:49,780 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 9 changer transitions 15/82 dead transitions. [2024-06-03 22:45:49,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 82 transitions, 743 flow [2024-06-03 22:45:49,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-03 22:45:49,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32 [2024-06-03 22:45:49,781 INFO L175 Difference]: Start difference. First operand has 104 places, 62 transitions, 521 flow. Second operand 10 states and 96 transitions. [2024-06-03 22:45:49,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 82 transitions, 743 flow [2024-06-03 22:45:49,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 82 transitions, 625 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-03 22:45:49,789 INFO L231 Difference]: Finished difference. Result has 102 places, 58 transitions, 401 flow [2024-06-03 22:45:49,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=401, PETRI_PLACES=102, PETRI_TRANSITIONS=58} [2024-06-03 22:45:49,790 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-03 22:45:49,790 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 58 transitions, 401 flow [2024-06-03 22:45:49,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:49,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:49,790 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:45:49,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:45:49,790 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:49,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash -760425475, now seen corresponding path program 4 times [2024-06-03 22:45:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262144074] [2024-06-03 22:45:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:53,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:45:53,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:53,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262144074] [2024-06-03 22:45:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262144074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:45:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110512155] [2024-06-03 22:45:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:53,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:45:53,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:53,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:45:53,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:45:53,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:53,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 58 transitions, 401 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:53,676 INFO L124 PetriNetUnfolderBase]: 165/352 cut-off events. [2024-06-03 22:45:53,676 INFO L125 PetriNetUnfolderBase]: For 8325/8325 co-relation queries the response was YES. [2024-06-03 22:45:53,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 352 events. 165/352 cut-off events. For 8325/8325 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1448 event pairs, 57 based on Foata normal form. 6/358 useless extension candidates. Maximal degree in co-relation 1474. Up to 214 conditions per place. [2024-06-03 22:45:53,678 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 15 changer transitions 19/75 dead transitions. [2024-06-03 22:45:53,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 75 transitions, 593 flow [2024-06-03 22:45:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:45:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:45:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-03 22:45:53,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2024-06-03 22:45:53,679 INFO L175 Difference]: Start difference. First operand has 102 places, 58 transitions, 401 flow. Second operand 9 states and 92 transitions. [2024-06-03 22:45:53,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 75 transitions, 593 flow [2024-06-03 22:45:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 75 transitions, 555 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:45:53,688 INFO L231 Difference]: Finished difference. Result has 100 places, 53 transitions, 369 flow [2024-06-03 22:45:53,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=369, PETRI_PLACES=100, PETRI_TRANSITIONS=53} [2024-06-03 22:45:53,688 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-03 22:45:53,688 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 53 transitions, 369 flow [2024-06-03 22:45:53,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:45:53,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:53,690 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:45:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:45:53,690 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:53,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 542080189, now seen corresponding path program 5 times [2024-06-03 22:45:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294119436] [2024-06-03 22:45:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:53,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:45:57,557 INFO 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:45:57,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:45:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294119436] [2024-06-03 22:45:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294119436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:45:57,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:45:57,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:45:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153562510] [2024-06-03 22:45:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:45:57,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:45:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:45:57,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:45:57,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:45:57,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:45:57,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 53 transitions, 369 flow. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:57,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:45:57,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:45:57,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:45:57,821 INFO L124 PetriNetUnfolderBase]: 147/306 cut-off events. [2024-06-03 22:45:57,821 INFO L125 PetriNetUnfolderBase]: For 6958/6958 co-relation queries the response was YES. [2024-06-03 22:45:57,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 306 events. 147/306 cut-off events. For 6958/6958 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1188 event pairs, 45 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1352. Up to 208 conditions per place. [2024-06-03 22:45:57,822 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 41 selfloop transitions, 23 changer transitions 0/66 dead transitions. [2024-06-03 22:45:57,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 66 transitions, 531 flow [2024-06-03 22:45:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:45:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:45:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2024-06-03 22:45:57,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2024-06-03 22:45:57,823 INFO L175 Difference]: Start difference. First operand has 100 places, 53 transitions, 369 flow. Second operand 10 states and 94 transitions. [2024-06-03 22:45:57,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 66 transitions, 531 flow [2024-06-03 22:45:57,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 66 transitions, 477 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:45:57,830 INFO L231 Difference]: Finished difference. Result has 94 places, 54 transitions, 371 flow [2024-06-03 22:45:57,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=371, PETRI_PLACES=94, PETRI_TRANSITIONS=54} [2024-06-03 22:45:57,831 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:45:57,831 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 54 transitions, 371 flow [2024-06-03 22:45:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:45:57,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:45:57,832 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:45:57,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:45:57,832 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:45:57,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:45:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 798672515, now seen corresponding path program 6 times [2024-06-03 22:45:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:45:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292600242] [2024-06-03 22:45:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:45:57,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:45:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:46:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:01,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292600242] [2024-06-03 22:46:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292600242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:01,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:46:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320843283] [2024-06-03 22:46:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:01,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:46:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:01,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:46:01,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:46:01,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:46:01,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 54 transitions, 371 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:01,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:01,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:46:01,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:01,396 INFO L124 PetriNetUnfolderBase]: 140/293 cut-off events. [2024-06-03 22:46:01,396 INFO L125 PetriNetUnfolderBase]: For 6138/6138 co-relation queries the response was YES. [2024-06-03 22:46:01,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 293 events. 140/293 cut-off events. For 6138/6138 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1132 event pairs, 32 based on Foata normal form. 6/299 useless extension candidates. Maximal degree in co-relation 1191. Up to 113 conditions per place. [2024-06-03 22:46:01,398 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 33 selfloop transitions, 15 changer transitions 16/66 dead transitions. [2024-06-03 22:46:01,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 66 transitions, 529 flow [2024-06-03 22:46:01,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:46:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:46:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-03 22:46:01,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2024-06-03 22:46:01,398 INFO L175 Difference]: Start difference. First operand has 94 places, 54 transitions, 371 flow. Second operand 9 states and 87 transitions. [2024-06-03 22:46:01,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 66 transitions, 529 flow [2024-06-03 22:46:01,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 66 transitions, 477 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:46:01,405 INFO L231 Difference]: Finished difference. Result has 94 places, 44 transitions, 293 flow [2024-06-03 22:46:01,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=293, PETRI_PLACES=94, PETRI_TRANSITIONS=44} [2024-06-03 22:46:01,406 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-03 22:46:01,406 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 44 transitions, 293 flow [2024-06-03 22:46:01,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:01,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:01,407 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:46:01,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:46:01,407 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:46:01,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 625951985, now seen corresponding path program 7 times [2024-06-03 22:46:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607222593] [2024-06-03 22:46:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:04,912 INFO 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:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:04,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607222593] [2024-06-03 22:46:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607222593] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:46:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873647464] [2024-06-03 22:46:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:04,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:46:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:46:04,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:46:04,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:46:04,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 44 transitions, 293 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:04,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:04,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:46:04,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:05,118 INFO L124 PetriNetUnfolderBase]: 93/204 cut-off events. [2024-06-03 22:46:05,118 INFO L125 PetriNetUnfolderBase]: For 4195/4195 co-relation queries the response was YES. [2024-06-03 22:46:05,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 204 events. 93/204 cut-off events. For 4195/4195 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 690 event pairs, 20 based on Foata normal form. 6/210 useless extension candidates. Maximal degree in co-relation 768. Up to 60 conditions per place. [2024-06-03 22:46:05,119 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 17 selfloop transitions, 3 changer transitions 33/55 dead transitions. [2024-06-03 22:46:05,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 55 transitions, 427 flow [2024-06-03 22:46:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:46:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:46:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-03 22:46:05,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2024-06-03 22:46:05,120 INFO L175 Difference]: Start difference. First operand has 94 places, 44 transitions, 293 flow. Second operand 8 states and 79 transitions. [2024-06-03 22:46:05,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 55 transitions, 427 flow [2024-06-03 22:46:05,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 55 transitions, 385 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-03 22:46:05,124 INFO L231 Difference]: Finished difference. Result has 82 places, 21 transitions, 124 flow [2024-06-03 22:46:05,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=82, PETRI_TRANSITIONS=21} [2024-06-03 22:46:05,124 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-03 22:46:05,124 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 21 transitions, 124 flow [2024-06-03 22:46:05,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:05,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:46:05,125 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:46:05,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:46:05,125 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:46:05,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:46:05,125 INFO L85 PathProgramCache]: Analyzing trace with hash 305172607, now seen corresponding path program 8 times [2024-06-03 22:46:05,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:46:05,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484501956] [2024-06-03 22:46:05,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:46:05,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:46:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:46:08,416 INFO 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:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:46:08,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484501956] [2024-06-03 22:46:08,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484501956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:46:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:46:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:46:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69902187] [2024-06-03 22:46:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:46:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:46:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:46:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:46:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:46:08,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 22:46:08,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 21 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:08,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:46:08,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 22:46:08,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:46:08,585 INFO L124 PetriNetUnfolderBase]: 25/65 cut-off events. [2024-06-03 22:46:08,585 INFO L125 PetriNetUnfolderBase]: For 1335/1335 co-relation queries the response was YES. [2024-06-03 22:46:08,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 65 events. 25/65 cut-off events. For 1335/1335 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 3 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 172. Up to 24 conditions per place. [2024-06-03 22:46:08,585 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2024-06-03 22:46:08,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 27 transitions, 144 flow [2024-06-03 22:46:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:46:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:46:08,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2024-06-03 22:46:08,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.275 [2024-06-03 22:46:08,586 INFO L175 Difference]: Start difference. First operand has 82 places, 21 transitions, 124 flow. Second operand 8 states and 66 transitions. [2024-06-03 22:46:08,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 27 transitions, 144 flow [2024-06-03 22:46:08,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 27 transitions, 110 flow, removed 1 selfloop flow, removed 16 redundant places. [2024-06-03 22:46:08,586 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-03 22:46:08,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2024-06-03 22:46:08,587 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-03 22:46:08,587 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-03 22:46:08,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 0 states have call successors, (0), 0 states 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:08,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-03 22:46:08,589 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-03 22:46:08,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-03 22:46:08,590 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-03 22:46:08,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:46:08,590 INFO L445 BasicCegarLoop]: Path program histogram: [8, 6, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:46:08,592 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-03 22:46:08,592 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-03 22:46:08,595 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-03 22:46:08,595 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-03 22:46:08,596 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.06 10:46:08 BasicIcfg [2024-06-03 22:46:08,596 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-03 22:46:08,596 INFO L158 Benchmark]: Toolchain (without parser) took 152510.69ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 91.2MB in the beginning and 679.5MB in the end (delta: -588.2MB). Peak memory consumption was 468.0MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,597 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:46:08,597 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-03 22:46:08,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 646.61ms. Allocated memory was 151.0MB in the beginning and 255.9MB in the end (delta: 104.9MB). Free memory was 90.8MB in the beginning and 209.2MB in the end (delta: -118.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.52ms. Allocated memory is still 255.9MB. Free memory was 209.2MB in the beginning and 197.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,597 INFO L158 Benchmark]: Boogie Preprocessor took 99.48ms. Allocated memory is still 255.9MB. Free memory was 196.6MB in the beginning and 190.3MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,598 INFO L158 Benchmark]: RCFGBuilder took 897.96ms. Allocated memory is still 255.9MB. Free memory was 190.3MB in the beginning and 185.0MB in the end (delta: 5.3MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,598 INFO L158 Benchmark]: TraceAbstraction took 150767.34ms. Allocated memory was 255.9MB in the beginning and 1.2GB in the end (delta: 950.0MB). Free memory was 183.9MB in the beginning and 679.5MB in the end (delta: -495.5MB). Peak memory consumption was 453.4MB. Max. memory is 16.1GB. [2024-06-03 22:46:08,599 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.16ms. Allocated memory is still 151.0MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 646.61ms. Allocated memory was 151.0MB in the beginning and 255.9MB in the end (delta: 104.9MB). Free memory was 90.8MB in the beginning and 209.2MB in the end (delta: -118.4MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.52ms. Allocated memory is still 255.9MB. Free memory was 209.2MB in the beginning and 197.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.48ms. Allocated memory is still 255.9MB. Free memory was 196.6MB in the beginning and 190.3MB in the end (delta: 6.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 897.96ms. Allocated memory is still 255.9MB. Free memory was 190.3MB in the beginning and 185.0MB in the end (delta: 5.3MB). Peak memory consumption was 128.0MB. Max. memory is 16.1GB. * TraceAbstraction took 150767.34ms. Allocated memory was 255.9MB in the beginning and 1.2GB in the end (delta: 950.0MB). Free memory was 183.9MB in the beginning and 679.5MB in the end (delta: -495.5MB). Peak memory consumption was 453.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 793]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 794]: 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, 47 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: 150.7s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2044 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1698 mSDsluCounter, 1121 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 907 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10015 IncrementalHoareTripleChecker+Invalid, 10397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 214 mSDtfsCounter, 10015 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 384 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=645occurred in iteration=19, InterpolantAutomatonStates: 362, 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.0s SatisfiabilityAnalysisTime, 135.2s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 653 ConstructedInterpolants, 0 QuantifiedInterpolants, 29525 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 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:46:08,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE