./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-04 18:09:43,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 18:09:43,142 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 18:09:43,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 18:09:43,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 18:09:43,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 18:09:43,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 18:09:43,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 18:09:43,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 18:09:43,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 18:09:43,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 18:09:43,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 18:09:43,161 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 18:09:43,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 18:09:43,162 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 18:09:43,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 18:09:43,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 18:09:43,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 18:09:43,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 18:09:43,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 18:09:43,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 18:09:43,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 18:09:43,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 18:09:43,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 18:09:43,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 18:09:43,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 18:09:43,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 18:09:43,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 18:09:43,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 18:09:43,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 18:09:43,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 18:09:43,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 18:09:43,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:09:43,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 18:09:43,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 18:09:43,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 18:09:43,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 18:09:43,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 18:09:43,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 18:09:43,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 18:09:43,169 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 18:09:43,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 18:09:43,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 18:09:43,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-04 18:09:43,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 18:09:43,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 18:09:43,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 18:09:43,361 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 18:09:43,362 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 18:09:43,363 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-04 18:09:43,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 18:09:43,497 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 18:09:43,498 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-04 18:09:44,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 18:09:44,785 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 18:09:44,786 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-04 18:09:44,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991e82c66/ef395e1ec41d4ec7b5de28284eee0089/FLAG4f83fe25e [2024-06-04 18:09:44,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991e82c66/ef395e1ec41d4ec7b5de28284eee0089 [2024-06-04 18:09:44,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 18:09:44,818 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 18:09:44,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 18:09:44,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 18:09:44,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 18:09:44,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:43" (1/2) ... [2024-06-04 18:09:44,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e067f1d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:44, skipping insertion in model container [2024-06-04 18:09:44,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:43" (1/2) ... [2024-06-04 18:09:44,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@746e1fe8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 06:09:44, skipping insertion in model container [2024-06-04 18:09:44,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:44" (2/2) ... [2024-06-04 18:09:44,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e067f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:44, skipping insertion in model container [2024-06-04 18:09:44,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 06:09:44" (2/2) ... [2024-06-04 18:09:44,830 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 18:09:44,877 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 18:09:44,878 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-04 18:09:44,878 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-04 18:09:44,879 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 18:09:44,879 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-04 18:09:44,922 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 18:09:45,247 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:09:45,260 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 18:09:45,465 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 18:09:45,519 INFO L206 MainTranslator]: Completed translation [2024-06-04 18:09:45,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45 WrapperNode [2024-06-04 18:09:45,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 18:09:45,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 18:09:45,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 18:09:45,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 18:09:45,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,599 INFO L138 Inliner]: procedures = 174, calls = 34, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 130 [2024-06-04 18:09:45,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 18:09:45,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 18:09:45,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 18:09:45,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 18:09:45,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,650 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-04 18:09:45,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,690 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 18:09:45,691 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 18:09:45,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 18:09:45,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 18:09:45,692 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (1/1) ... [2024-06-04 18:09:45,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 18:09:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 18:09:45,713 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-04 18:09:45,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-04 18:09:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 18:09:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 18:09:45,744 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 18:09:45,744 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 18:09:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 18:09:45,745 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 18:09:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 18:09:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 18:09:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 18:09:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 18:09:45,746 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 18:09:45,870 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 18:09:45,872 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 18:09:46,450 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 18:09:46,450 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 18:09:46,569 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 18:09:46,570 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 18:09:46,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:09:46 BoogieIcfgContainer [2024-06-04 18:09:46,572 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 18:09:46,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 18:09:46,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 18:09:46,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 18:09:46,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 06:09:43" (1/4) ... [2024-06-04 18:09:46,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b61aab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 06:09:46, skipping insertion in model container [2024-06-04 18:09:46,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 06:09:44" (2/4) ... [2024-06-04 18:09:46,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b61aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:09:46, skipping insertion in model container [2024-06-04 18:09:46,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 06:09:45" (3/4) ... [2024-06-04 18:09:46,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69b61aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 06:09:46, skipping insertion in model container [2024-06-04 18:09:46,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 06:09:46" (4/4) ... [2024-06-04 18:09:46,640 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-04 18:09:46,653 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 18:09:46,653 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-04 18:09:46,654 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 18:09:46,715 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 18:09:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 18:09:46,775 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-04 18:09:46,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:09:46,777 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-04 18:09:46,777 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-04 18:09:46,779 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-04 18:09:46,791 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 18:09:46,798 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;@345a46b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 18:09:46,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-04 18:09:46,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 18:09:46,804 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 18:09:46,804 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 18:09:46,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:46,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 18:09:46,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:09:46,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1350958641, now seen corresponding path program 1 times [2024-06-04 18:09:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318553943] [2024-06-04 18:09:46,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:09:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318553943] [2024-06-04 18:09:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318553943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:49,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:49,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 18:09:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512642552] [2024-06-04 18:09:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:49,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 18:09:49,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 18:09:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 18:09:49,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:09:49,308 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-04 18:09:49,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:49,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:09:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:49,450 INFO L124 PetriNetUnfolderBase]: 162/297 cut-off events. [2024-06-04 18:09:49,450 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-04 18:09:49,452 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-04 18:09:49,454 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-04 18:09:49,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 117 flow [2024-06-04 18:09:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 18:09:49,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 18:09:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-06-04 18:09:49,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-06-04 18:09:49,464 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 46 transitions. [2024-06-04 18:09:49,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 117 flow [2024-06-04 18:09:49,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-04 18:09:49,467 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-04 18:09:49,469 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-04 18:09:49,471 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-04 18:09:49,471 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-04 18:09:49,471 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-04 18:09:49,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:49,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:49,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 18:09:49,472 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:09:49,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1191162640, now seen corresponding path program 1 times [2024-06-04 18:09:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609032388] [2024-06-04 18:09:49,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:51,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:09:51,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:51,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609032388] [2024-06-04 18:09:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609032388] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:51,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:51,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 18:09:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154125893] [2024-06-04 18:09:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 18:09:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:51,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 18:09:51,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 18:09:51,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:09:51,087 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-04 18:09:51,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:51,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:09:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:51,236 INFO L124 PetriNetUnfolderBase]: 159/292 cut-off events. [2024-06-04 18:09:51,237 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-04 18:09:51,239 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-04 18:09:51,242 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 27 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-04 18:09:51,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 159 flow [2024-06-04 18:09:51,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 18:09:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 18:09:51,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2024-06-04 18:09:51,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-06-04 18:09:51,245 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 58 transitions. [2024-06-04 18:09:51,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 159 flow [2024-06-04 18:09:51,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 18:09:51,248 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-04 18:09:51,249 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-04 18:09:51,250 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-04 18:09:51,250 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-04 18:09:51,250 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-04 18:09:51,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:51,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:51,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 18:09:51,251 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:09:51,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1728662762, now seen corresponding path program 1 times [2024-06-04 18:09:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961868727] [2024-06-04 18:09:51,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:52,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:09:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961868727] [2024-06-04 18:09:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961868727] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 18:09:52,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942395940] [2024-06-04 18:09:52,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:52,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 18:09:52,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 18:09:52,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 18:09:52,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:09:52,682 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-04 18:09:52,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:52,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:09:52,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:52,841 INFO L124 PetriNetUnfolderBase]: 160/294 cut-off events. [2024-06-04 18:09:52,841 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2024-06-04 18:09:52,842 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-04 18:09:52,844 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 35 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2024-06-04 18:09:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 251 flow [2024-06-04 18:09:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:09:52,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:09:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2024-06-04 18:09:52,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2024-06-04 18:09:52,847 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 76 transitions. [2024-06-04 18:09:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 251 flow [2024-06-04 18:09:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 242 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-04 18:09:52,850 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 160 flow [2024-06-04 18:09:52,850 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-04 18:09:52,851 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-04 18:09:52,851 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 160 flow [2024-06-04 18:09:52,851 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-04 18:09:52,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:52,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:52,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 18:09:52,852 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:09:52,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:52,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2048936977, now seen corresponding path program 1 times [2024-06-04 18:09:52,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:52,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520038122] [2024-06-04 18:09:52,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:09:54,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520038122] [2024-06-04 18:09:54,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520038122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:54,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:54,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:09:54,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129669808] [2024-06-04 18:09:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:54,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:09:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:09:54,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:09:54,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:09:54,512 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-04 18:09:54,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:54,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:09:54,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:54,694 INFO L124 PetriNetUnfolderBase]: 179/326 cut-off events. [2024-06-04 18:09:54,694 INFO L125 PetriNetUnfolderBase]: For 382/382 co-relation queries the response was YES. [2024-06-04 18:09:54,695 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-04 18:09:54,696 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 47 selfloop transitions, 19 changer transitions 0/68 dead transitions. [2024-06-04 18:09:54,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 68 transitions, 406 flow [2024-06-04 18:09:54,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:09:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:09:54,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-04 18:09:54,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-06-04 18:09:54,698 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 160 flow. Second operand 6 states and 98 transitions. [2024-06-04 18:09:54,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 68 transitions, 406 flow [2024-06-04 18:09:54,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 68 transitions, 402 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-04 18:09:54,700 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 275 flow [2024-06-04 18:09:54,701 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-04 18:09:54,701 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-04 18:09:54,701 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 275 flow [2024-06-04 18:09:54,702 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-04 18:09:54,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:54,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:54,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 18:09:54,702 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-04 18:09:54,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1764554869, now seen corresponding path program 1 times [2024-06-04 18:09:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:54,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134317499] [2024-06-04 18:09:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:09:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134317499] [2024-06-04 18:09:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134317499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:09:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937938272] [2024-06-04 18:09:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:56,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:09:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:56,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:09:56,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:09:56,607 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-04 18:09:56,607 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-04 18:09:56,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:56,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-04 18:09:56,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:56,860 INFO L124 PetriNetUnfolderBase]: 180/329 cut-off events. [2024-06-04 18:09:56,861 INFO L125 PetriNetUnfolderBase]: For 692/692 co-relation queries the response was YES. [2024-06-04 18:09:56,862 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-04 18:09:56,863 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 16 changer transitions 0/66 dead transitions. [2024-06-04 18:09:56,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 468 flow [2024-06-04 18:09:56,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:09:56,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:09:56,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-04 18:09:56,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-04 18:09:56,864 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 275 flow. Second operand 7 states and 97 transitions. [2024-06-04 18:09:56,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 468 flow [2024-06-04 18:09:56,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 456 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-04 18:09:56,868 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 309 flow [2024-06-04 18:09:56,868 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-04 18:09:56,868 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-04 18:09:56,869 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 309 flow [2024-06-04 18:09:56,869 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-04 18:09:56,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:56,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:56,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 18:09:56,869 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-04 18:09:56,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:56,870 INFO L85 PathProgramCache]: Analyzing trace with hash 288827368, now seen corresponding path program 1 times [2024-06-04 18:09:56,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:56,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480793481] [2024-06-04 18:09:56,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:56,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480793481] [2024-06-04 18:10:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480793481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:00,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 18:10:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048591758] [2024-06-04 18:10:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:00,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 18:10:00,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:00,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 18:10:00,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 18:10:00,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:00,084 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-04 18:10:00,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:00,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:00,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:00,277 INFO L124 PetriNetUnfolderBase]: 178/326 cut-off events. [2024-06-04 18:10:00,277 INFO L125 PetriNetUnfolderBase]: For 843/843 co-relation queries the response was YES. [2024-06-04 18:10:00,279 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-04 18:10:00,280 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 43 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-06-04 18:10:00,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 419 flow [2024-06-04 18:10:00,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:10:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:10:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2024-06-04 18:10:00,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-04 18:10:00,283 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 309 flow. Second operand 5 states and 54 transitions. [2024-06-04 18:10:00,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 419 flow [2024-06-04 18:10:00,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 382 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:00,286 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 289 flow [2024-06-04 18:10:00,286 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-04 18:10:00,289 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-06-04 18:10:00,289 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 289 flow [2024-06-04 18:10:00,289 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-04 18:10:00,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:00,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:00,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 18:10:00,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:00,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 362820704, now seen corresponding path program 1 times [2024-06-04 18:10:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037498205] [2024-06-04 18:10:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:00,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:03,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:03,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037498205] [2024-06-04 18:10:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037498205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:03,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:03,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41979871] [2024-06-04 18:10:03,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:03,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:03,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:03,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:03,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:03,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:03,619 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-04 18:10:03,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:03,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:03,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:03,803 INFO L124 PetriNetUnfolderBase]: 174/320 cut-off events. [2024-06-04 18:10:03,803 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2024-06-04 18:10:03,804 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-04 18:10:03,806 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 43 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2024-06-04 18:10:03,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 407 flow [2024-06-04 18:10:03,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2024-06-04 18:10:03,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35 [2024-06-04 18:10:03,807 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 289 flow. Second operand 6 states and 63 transitions. [2024-06-04 18:10:03,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 407 flow [2024-06-04 18:10:03,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 392 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:03,810 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 295 flow [2024-06-04 18:10:03,810 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-04 18:10:03,810 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 27 predicate places. [2024-06-04 18:10:03,810 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 295 flow [2024-06-04 18:10:03,811 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-04 18:10:03,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:03,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:03,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 18:10:03,811 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:03,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1820617125, now seen corresponding path program 1 times [2024-06-04 18:10:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723180898] [2024-06-04 18:10:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:06,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:06,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723180898] [2024-06-04 18:10:06,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723180898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:06,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:06,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:06,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780102312] [2024-06-04 18:10:06,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:06,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:06,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:06,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:06,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:06,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:06,512 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-04 18:10:06,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:06,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:06,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:06,753 INFO L124 PetriNetUnfolderBase]: 175/322 cut-off events. [2024-06-04 18:10:06,753 INFO L125 PetriNetUnfolderBase]: For 1068/1068 co-relation queries the response was YES. [2024-06-04 18:10:06,756 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-04 18:10:06,758 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 43 selfloop transitions, 14 changer transitions 0/59 dead transitions. [2024-06-04 18:10:06,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 465 flow [2024-06-04 18:10:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2024-06-04 18:10:06,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-04 18:10:06,761 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 295 flow. Second operand 7 states and 77 transitions. [2024-06-04 18:10:06,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 465 flow [2024-06-04 18:10:06,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 439 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:06,764 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 322 flow [2024-06-04 18:10:06,764 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-04 18:10:06,766 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-04 18:10:06,766 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 322 flow [2024-06-04 18:10:06,766 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-04 18:10:06,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:06,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:06,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 18:10:06,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:06,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1826331045, now seen corresponding path program 2 times [2024-06-04 18:10:06,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10165404] [2024-06-04 18:10:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:09,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:09,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10165404] [2024-06-04 18:10:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10165404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:09,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:09,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:10:09,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215294659] [2024-06-04 18:10:09,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:09,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:10:09,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:09,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:10:09,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:10:09,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:09,400 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-04 18:10:09,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:09,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:09,565 INFO L124 PetriNetUnfolderBase]: 170/312 cut-off events. [2024-06-04 18:10:09,565 INFO L125 PetriNetUnfolderBase]: For 1166/1166 co-relation queries the response was YES. [2024-06-04 18:10:09,566 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-04 18:10:09,567 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2024-06-04 18:10:09,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 54 transitions, 440 flow [2024-06-04 18:10:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:10:09,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:10:09,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2024-06-04 18:10:09,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34444444444444444 [2024-06-04 18:10:09,569 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 322 flow. Second operand 6 states and 62 transitions. [2024-06-04 18:10:09,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 54 transitions, 440 flow [2024-06-04 18:10:09,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 423 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:09,572 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 326 flow [2024-06-04 18:10:09,572 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-04 18:10:09,572 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2024-06-04 18:10:09,572 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 326 flow [2024-06-04 18:10:09,573 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-04 18:10:09,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:09,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:09,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 18:10:09,573 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:09,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash 604556645, now seen corresponding path program 1 times [2024-06-04 18:10:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:09,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386562093] [2024-06-04 18:10:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:12,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:12,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386562093] [2024-06-04 18:10:12,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386562093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:12,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:12,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:12,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399655662] [2024-06-04 18:10:12,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:12,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:12,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:12,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:12,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:12,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:12,383 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-04 18:10:12,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:12,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:12,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:12,552 INFO L124 PetriNetUnfolderBase]: 190/346 cut-off events. [2024-06-04 18:10:12,553 INFO L125 PetriNetUnfolderBase]: For 1629/1629 co-relation queries the response was YES. [2024-06-04 18:10:12,554 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-04 18:10:12,555 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 45 selfloop transitions, 26 changer transitions 0/73 dead transitions. [2024-06-04 18:10:12,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 73 transitions, 586 flow [2024-06-04 18:10:12,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:12,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-04 18:10:12,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 18:10:12,557 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 326 flow. Second operand 7 states and 90 transitions. [2024-06-04 18:10:12,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 73 transitions, 586 flow [2024-06-04 18:10:12,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 552 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:12,560 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 416 flow [2024-06-04 18:10:12,561 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-04 18:10:12,561 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2024-06-04 18:10:12,562 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 416 flow [2024-06-04 18:10:12,562 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-04 18:10:12,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:12,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:12,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 18:10:12,562 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:12,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:12,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1637231969, now seen corresponding path program 2 times [2024-06-04 18:10:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:12,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51349635] [2024-06-04 18:10:12,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:12,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:15,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51349635] [2024-06-04 18:10:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51349635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129573234] [2024-06-04 18:10:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:15,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:15,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:15,229 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-04 18:10:15,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:15,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:15,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:15,398 INFO L124 PetriNetUnfolderBase]: 196/356 cut-off events. [2024-06-04 18:10:15,399 INFO L125 PetriNetUnfolderBase]: For 1828/1828 co-relation queries the response was YES. [2024-06-04 18:10:15,399 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-04 18:10:15,401 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 55 selfloop transitions, 12 changer transitions 0/69 dead transitions. [2024-06-04 18:10:15,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 69 transitions, 597 flow [2024-06-04 18:10:15,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-04 18:10:15,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2024-06-04 18:10:15,402 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 416 flow. Second operand 7 states and 72 transitions. [2024-06-04 18:10:15,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 69 transitions, 597 flow [2024-06-04 18:10:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 581 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-04 18:10:15,405 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 467 flow [2024-06-04 18:10:15,405 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-04 18:10:15,406 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2024-06-04 18:10:15,406 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 467 flow [2024-06-04 18:10:15,406 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-04 18:10:15,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:15,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:15,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 18:10:15,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:15,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:15,407 INFO L85 PathProgramCache]: Analyzing trace with hash 781688165, now seen corresponding path program 3 times [2024-06-04 18:10:15,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:15,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453302931] [2024-06-04 18:10:15,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:15,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:18,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:18,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453302931] [2024-06-04 18:10:18,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453302931] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:18,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:18,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:18,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94238965] [2024-06-04 18:10:18,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:18,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:18,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:18,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:18,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:18,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:18,175 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-04 18:10:18,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:18,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:18,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:18,349 INFO L124 PetriNetUnfolderBase]: 197/358 cut-off events. [2024-06-04 18:10:18,349 INFO L125 PetriNetUnfolderBase]: For 2116/2116 co-relation queries the response was YES. [2024-06-04 18:10:18,350 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-04 18:10:18,352 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 55 selfloop transitions, 16 changer transitions 0/73 dead transitions. [2024-06-04 18:10:18,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 73 transitions, 679 flow [2024-06-04 18:10:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:18,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-04 18:10:18,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3619047619047619 [2024-06-04 18:10:18,353 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 467 flow. Second operand 7 states and 76 transitions. [2024-06-04 18:10:18,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 73 transitions, 679 flow [2024-06-04 18:10:18,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 73 transitions, 661 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:18,358 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 508 flow [2024-06-04 18:10:18,358 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-04 18:10:18,358 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2024-06-04 18:10:18,359 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 508 flow [2024-06-04 18:10:18,359 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-04 18:10:18,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:18,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:18,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 18:10:18,359 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:18,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:18,360 INFO L85 PathProgramCache]: Analyzing trace with hash 781934243, now seen corresponding path program 1 times [2024-06-04 18:10:18,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:18,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377674465] [2024-06-04 18:10:18,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:18,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:21,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377674465] [2024-06-04 18:10:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377674465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160312771] [2024-06-04 18:10:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:21,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:21,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:21,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:21,556 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-04 18:10:21,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:21,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:21,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:21,788 INFO L124 PetriNetUnfolderBase]: 194/353 cut-off events. [2024-06-04 18:10:21,788 INFO L125 PetriNetUnfolderBase]: For 2315/2315 co-relation queries the response was YES. [2024-06-04 18:10:21,789 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-04 18:10:21,791 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 59 selfloop transitions, 10 changer transitions 0/71 dead transitions. [2024-06-04 18:10:21,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 71 transitions, 664 flow [2024-06-04 18:10:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 70 transitions. [2024-06-04 18:10:21,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:10:21,792 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 508 flow. Second operand 7 states and 70 transitions. [2024-06-04 18:10:21,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 71 transitions, 664 flow [2024-06-04 18:10:21,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 71 transitions, 634 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:21,796 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 502 flow [2024-06-04 18:10:21,796 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-04 18:10:21,797 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 45 predicate places. [2024-06-04 18:10:21,797 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 502 flow [2024-06-04 18:10:21,797 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-04 18:10:21,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:21,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:21,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 18:10:21,798 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:21,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:21,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1736925624, now seen corresponding path program 1 times [2024-06-04 18:10:21,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:21,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275963780] [2024-06-04 18:10:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:25,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:25,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275963780] [2024-06-04 18:10:25,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275963780] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:25,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:25,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273266627] [2024-06-04 18:10:25,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:25,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:25,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:25,172 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-04 18:10:25,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:25,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:25,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:25,457 INFO L124 PetriNetUnfolderBase]: 190/346 cut-off events. [2024-06-04 18:10:25,457 INFO L125 PetriNetUnfolderBase]: For 2408/2408 co-relation queries the response was YES. [2024-06-04 18:10:25,458 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-04 18:10:25,460 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 58 selfloop transitions, 19 changer transitions 0/79 dead transitions. [2024-06-04 18:10:25,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 79 transitions, 699 flow [2024-06-04 18:10:25,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:10:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:10:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 18:10:25,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-04 18:10:25,461 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 502 flow. Second operand 9 states and 96 transitions. [2024-06-04 18:10:25,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 79 transitions, 699 flow [2024-06-04 18:10:25,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 79 transitions, 671 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:25,466 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 527 flow [2024-06-04 18:10:25,466 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-04 18:10:25,467 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-04 18:10:25,467 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 527 flow [2024-06-04 18:10:25,467 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-04 18:10:25,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:25,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:25,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 18:10:25,468 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:25,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 766473397, now seen corresponding path program 1 times [2024-06-04 18:10:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:25,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768292840] [2024-06-04 18:10:25,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:25,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:27,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:27,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768292840] [2024-06-04 18:10:27,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768292840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:27,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:27,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:27,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565551256] [2024-06-04 18:10:27,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:27,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:27,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:27,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:27,711 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-04 18:10:27,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:27,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:27,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:27,890 INFO L124 PetriNetUnfolderBase]: 206/372 cut-off events. [2024-06-04 18:10:27,891 INFO L125 PetriNetUnfolderBase]: For 3061/3061 co-relation queries the response was YES. [2024-06-04 18:10:27,892 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-04 18:10:27,893 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 47 selfloop transitions, 34 changer transitions 0/83 dead transitions. [2024-06-04 18:10:27,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 83 transitions, 811 flow [2024-06-04 18:10:27,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2024-06-04 18:10:27,894 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142857142857143 [2024-06-04 18:10:27,895 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 527 flow. Second operand 7 states and 87 transitions. [2024-06-04 18:10:27,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 83 transitions, 811 flow [2024-06-04 18:10:27,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 769 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 18:10:27,900 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 587 flow [2024-06-04 18:10:27,900 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-04 18:10:27,901 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-04 18:10:27,901 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 587 flow [2024-06-04 18:10:27,901 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-04 18:10:27,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:27,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:27,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 18:10:27,901 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:27,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:27,902 INFO L85 PathProgramCache]: Analyzing trace with hash 766467817, now seen corresponding path program 2 times [2024-06-04 18:10:27,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954142166] [2024-06-04 18:10:27,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:27,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954142166] [2024-06-04 18:10:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954142166] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:30,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:30,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:30,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995209693] [2024-06-04 18:10:30,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:30,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:30,194 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-04 18:10:30,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:30,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:30,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:30,345 INFO L124 PetriNetUnfolderBase]: 198/360 cut-off events. [2024-06-04 18:10:30,346 INFO L125 PetriNetUnfolderBase]: For 3361/3361 co-relation queries the response was YES. [2024-06-04 18:10:30,347 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-04 18:10:30,348 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 48 selfloop transitions, 36 changer transitions 0/86 dead transitions. [2024-06-04 18:10:30,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 863 flow [2024-06-04 18:10:30,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-04 18:10:30,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-04 18:10:30,350 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 587 flow. Second operand 7 states and 92 transitions. [2024-06-04 18:10:30,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 863 flow [2024-06-04 18:10:30,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 86 transitions, 830 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-04 18:10:30,356 INFO L231 Difference]: Finished difference. Result has 81 places, 68 transitions, 634 flow [2024-06-04 18:10:30,357 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-04 18:10:30,357 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-04 18:10:30,357 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 68 transitions, 634 flow [2024-06-04 18:10:30,358 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-04 18:10:30,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:30,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:30,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 18:10:30,358 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:30,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash -792565921, now seen corresponding path program 3 times [2024-06-04 18:10:30,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:30,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258076705] [2024-06-04 18:10:30,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:30,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258076705] [2024-06-04 18:10:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258076705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:10:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696494249] [2024-06-04 18:10:32,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:32,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:10:32,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:32,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:10:32,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:10:32,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:32,991 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-04 18:10:32,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:32,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:32,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:33,189 INFO L124 PetriNetUnfolderBase]: 198/360 cut-off events. [2024-06-04 18:10:33,189 INFO L125 PetriNetUnfolderBase]: For 3501/3501 co-relation queries the response was YES. [2024-06-04 18:10:33,190 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-04 18:10:33,192 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-04 18:10:33,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 80 transitions, 834 flow [2024-06-04 18:10:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:33,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 18:10:33,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 18:10:33,193 INFO L175 Difference]: Start difference. First operand has 81 places, 68 transitions, 634 flow. Second operand 8 states and 81 transitions. [2024-06-04 18:10:33,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 80 transitions, 834 flow [2024-06-04 18:10:33,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 80 transitions, 747 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:33,226 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 602 flow [2024-06-04 18:10:33,226 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-04 18:10:33,226 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 54 predicate places. [2024-06-04 18:10:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 602 flow [2024-06-04 18:10:33,227 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-04 18:10:33,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:33,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:33,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 18:10:33,227 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:33,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1640715078, now seen corresponding path program 1 times [2024-06-04 18:10:33,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:33,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152062301] [2024-06-04 18:10:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:36,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:36,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152062301] [2024-06-04 18:10:36,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152062301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:36,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:36,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19945301] [2024-06-04 18:10:36,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:36,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:36,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:36,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:36,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:36,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:36,181 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-04 18:10:36,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:36,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:36,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:36,425 INFO L124 PetriNetUnfolderBase]: 196/357 cut-off events. [2024-06-04 18:10:36,425 INFO L125 PetriNetUnfolderBase]: For 3336/3336 co-relation queries the response was YES. [2024-06-04 18:10:36,426 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-04 18:10:36,427 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 63 selfloop transitions, 13 changer transitions 0/78 dead transitions. [2024-06-04 18:10:36,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 78 transitions, 774 flow [2024-06-04 18:10:36,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:10:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:10:36,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2024-06-04 18:10:36,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2024-06-04 18:10:36,429 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 602 flow. Second operand 7 states and 72 transitions. [2024-06-04 18:10:36,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 78 transitions, 774 flow [2024-06-04 18:10:36,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 741 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:36,438 INFO L231 Difference]: Finished difference. Result has 84 places, 70 transitions, 603 flow [2024-06-04 18:10:36,438 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-04 18:10:36,439 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 55 predicate places. [2024-06-04 18:10:36,439 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 70 transitions, 603 flow [2024-06-04 18:10:36,439 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-04 18:10:36,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:36,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:36,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 18:10:36,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:36,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1040038856, now seen corresponding path program 1 times [2024-06-04 18:10:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521018863] [2024-06-04 18:10:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:39,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-04 18:10:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521018863] [2024-06-04 18:10:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521018863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454403432] [2024-06-04 18:10:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:39,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:39,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:39,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:39,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:39,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:39,628 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-04 18:10:39,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:39,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:39,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:39,899 INFO L124 PetriNetUnfolderBase]: 229/424 cut-off events. [2024-06-04 18:10:39,899 INFO L125 PetriNetUnfolderBase]: For 5540/5540 co-relation queries the response was YES. [2024-06-04 18:10:39,900 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-04 18:10:39,902 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 60 selfloop transitions, 35 changer transitions 0/97 dead transitions. [2024-06-04 18:10:39,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 97 transitions, 983 flow [2024-06-04 18:10:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:10:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:10:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-04 18:10:39,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-04 18:10:39,903 INFO L175 Difference]: Start difference. First operand has 84 places, 70 transitions, 603 flow. Second operand 9 states and 107 transitions. [2024-06-04 18:10:39,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 97 transitions, 983 flow [2024-06-04 18:10:39,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 935 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-04 18:10:39,911 INFO L231 Difference]: Finished difference. Result has 86 places, 71 transitions, 645 flow [2024-06-04 18:10:39,911 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-04 18:10:39,911 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-04 18:10:39,911 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 71 transitions, 645 flow [2024-06-04 18:10:39,911 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-04 18:10:39,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:39,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:39,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 18:10:39,912 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:39,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2127393440, now seen corresponding path program 2 times [2024-06-04 18:10:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:39,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110073876] [2024-06-04 18:10:39,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:39,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:43,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110073876] [2024-06-04 18:10:43,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110073876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:43,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:43,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731970114] [2024-06-04 18:10:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:43,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:43,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:43,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:43,215 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-04 18:10:43,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:43,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:43,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:43,469 INFO L124 PetriNetUnfolderBase]: 226/419 cut-off events. [2024-06-04 18:10:43,469 INFO L125 PetriNetUnfolderBase]: For 5339/5339 co-relation queries the response was YES. [2024-06-04 18:10:43,471 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-04 18:10:43,472 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 19 changer transitions 0/87 dead transitions. [2024-06-04 18:10:43,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 853 flow [2024-06-04 18:10:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:10:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:10:43,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-04 18:10:43,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592592592592593 [2024-06-04 18:10:43,475 INFO L175 Difference]: Start difference. First operand has 86 places, 71 transitions, 645 flow. Second operand 9 states and 97 transitions. [2024-06-04 18:10:43,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 853 flow [2024-06-04 18:10:43,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 787 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:43,500 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 621 flow [2024-06-04 18:10:43,500 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-04 18:10:43,501 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-04 18:10:43,501 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 621 flow [2024-06-04 18:10:43,501 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-04 18:10:43,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:43,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:43,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 18:10:43,502 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:43,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1042900590, now seen corresponding path program 1 times [2024-06-04 18:10:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060290932] [2024-06-04 18:10:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:46,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:46,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:46,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060290932] [2024-06-04 18:10:46,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060290932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:46,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:46,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250263524] [2024-06-04 18:10:46,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:46,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:46,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:46,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:46,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:46,714 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-04 18:10:46,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:46,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:46,931 INFO L124 PetriNetUnfolderBase]: 222/413 cut-off events. [2024-06-04 18:10:46,932 INFO L125 PetriNetUnfolderBase]: For 5409/5409 co-relation queries the response was YES. [2024-06-04 18:10:46,933 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-04 18:10:46,935 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 51 selfloop transitions, 33 changer transitions 0/86 dead transitions. [2024-06-04 18:10:46,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 86 transitions, 867 flow [2024-06-04 18:10:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:46,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-04 18:10:46,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-04 18:10:46,936 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 621 flow. Second operand 8 states and 96 transitions. [2024-06-04 18:10:46,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 86 transitions, 867 flow [2024-06-04 18:10:46,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 814 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-04 18:10:46,943 INFO L231 Difference]: Finished difference. Result has 89 places, 71 transitions, 639 flow [2024-06-04 18:10:46,943 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-04 18:10:46,943 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-04 18:10:46,944 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 71 transitions, 639 flow [2024-06-04 18:10:46,944 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-04 18:10:46,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:46,944 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:46,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 18:10:46,944 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:46,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:46,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1913411342, now seen corresponding path program 1 times [2024-06-04 18:10:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:46,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030337699] [2024-06-04 18:10:46,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:46,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:49,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:49,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030337699] [2024-06-04 18:10:49,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030337699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:49,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:49,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243217826] [2024-06-04 18:10:49,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:49,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:49,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:49,852 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-04 18:10:49,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:49,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:49,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:50,102 INFO L124 PetriNetUnfolderBase]: 217/406 cut-off events. [2024-06-04 18:10:50,102 INFO L125 PetriNetUnfolderBase]: For 6431/6431 co-relation queries the response was YES. [2024-06-04 18:10:50,103 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-04 18:10:50,105 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 52 selfloop transitions, 33 changer transitions 7/94 dead transitions. [2024-06-04 18:10:50,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 94 transitions, 935 flow [2024-06-04 18:10:50,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:10:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:10:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-04 18:10:50,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-04 18:10:50,107 INFO L175 Difference]: Start difference. First operand has 89 places, 71 transitions, 639 flow. Second operand 9 states and 109 transitions. [2024-06-04 18:10:50,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 94 transitions, 935 flow [2024-06-04 18:10:50,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 94 transitions, 843 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 18:10:50,114 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 613 flow [2024-06-04 18:10:50,115 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-04 18:10:50,115 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-04 18:10:50,115 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 613 flow [2024-06-04 18:10:50,115 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-04 18:10:50,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:50,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:50,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 18:10:50,116 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:50,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:50,116 INFO L85 PathProgramCache]: Analyzing trace with hash 677210174, now seen corresponding path program 2 times [2024-06-04 18:10:50,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:50,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134691081] [2024-06-04 18:10:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134691081] [2024-06-04 18:10:53,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134691081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:53,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:53,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:53,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158305897] [2024-06-04 18:10:53,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:53,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:10:53,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:53,395 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-04 18:10:53,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:53,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:53,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:53,580 INFO L124 PetriNetUnfolderBase]: 197/366 cut-off events. [2024-06-04 18:10:53,580 INFO L125 PetriNetUnfolderBase]: For 4364/4364 co-relation queries the response was YES. [2024-06-04 18:10:53,581 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-04 18:10:53,583 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 66 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2024-06-04 18:10:53,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 81 transitions, 803 flow [2024-06-04 18:10:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-04 18:10:53,584 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:10:53,584 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 613 flow. Second operand 8 states and 80 transitions. [2024-06-04 18:10:53,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 81 transitions, 803 flow [2024-06-04 18:10:53,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 716 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-04 18:10:53,602 INFO L231 Difference]: Finished difference. Result has 90 places, 71 transitions, 566 flow [2024-06-04 18:10:53,602 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-04 18:10:53,602 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-04 18:10:53,602 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 71 transitions, 566 flow [2024-06-04 18:10:53,603 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-04 18:10:53,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:53,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:53,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 18:10:53,603 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:53,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:53,603 INFO L85 PathProgramCache]: Analyzing trace with hash -180457406, now seen corresponding path program 3 times [2024-06-04 18:10:53,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:53,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411775498] [2024-06-04 18:10:53,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:53,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411775498] [2024-06-04 18:10:56,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411775498] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:56,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:56,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809682875] [2024-06-04 18:10:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:56,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:56,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:56,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:10:56,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:10:56,678 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-04 18:10:56,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:56,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:10:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:56,901 INFO L124 PetriNetUnfolderBase]: 201/374 cut-off events. [2024-06-04 18:10:56,902 INFO L125 PetriNetUnfolderBase]: For 4569/4569 co-relation queries the response was YES. [2024-06-04 18:10:56,903 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-04 18:10:56,905 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 69 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2024-06-04 18:10:56,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 82 transitions, 758 flow [2024-06-04 18:10:56,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:56,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2024-06-04 18:10:56,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.325 [2024-06-04 18:10:56,907 INFO L175 Difference]: Start difference. First operand has 90 places, 71 transitions, 566 flow. Second operand 8 states and 78 transitions. [2024-06-04 18:10:56,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 82 transitions, 758 flow [2024-06-04 18:10:56,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 82 transitions, 728 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-04 18:10:56,914 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 574 flow [2024-06-04 18:10:56,914 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-04 18:10:56,915 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-06-04 18:10:56,915 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 574 flow [2024-06-04 18:10:56,915 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-04 18:10:56,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:56,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:56,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 18:10:56,915 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:10:56,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:56,916 INFO L85 PathProgramCache]: Analyzing trace with hash 449309024, now seen corresponding path program 4 times [2024-06-04 18:10:56,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:56,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972278177] [2024-06-04 18:10:56,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:10:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972278177] [2024-06-04 18:10:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972278177] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:59,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:59,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258141104] [2024-06-04 18:10:59,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:59,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:59,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:59,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:00,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:00,078 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-04 18:11:00,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:00,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:00,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:00,323 INFO L124 PetriNetUnfolderBase]: 205/382 cut-off events. [2024-06-04 18:11:00,323 INFO L125 PetriNetUnfolderBase]: For 5067/5067 co-relation queries the response was YES. [2024-06-04 18:11:00,324 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-04 18:11:00,326 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 65 selfloop transitions, 17 changer transitions 0/84 dead transitions. [2024-06-04 18:11:00,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 84 transitions, 778 flow [2024-06-04 18:11:00,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2024-06-04 18:11:00,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3458333333333333 [2024-06-04 18:11:00,341 INFO L175 Difference]: Start difference. First operand has 92 places, 72 transitions, 574 flow. Second operand 8 states and 83 transitions. [2024-06-04 18:11:00,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 84 transitions, 778 flow [2024-06-04 18:11:00,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 84 transitions, 750 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:00,349 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 598 flow [2024-06-04 18:11:00,349 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-04 18:11:00,350 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:11:00,350 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 598 flow [2024-06-04 18:11:00,350 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-04 18:11:00,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:00,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:00,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 18:11:00,351 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:00,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash 685484136, now seen corresponding path program 1 times [2024-06-04 18:11:00,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:00,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430044249] [2024-06-04 18:11:00,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:00,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:03,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:03,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:03,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430044249] [2024-06-04 18:11:03,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430044249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:03,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097866357] [2024-06-04 18:11:03,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:03,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:03,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:03,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:03,346 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-04 18:11:03,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:03,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:03,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:03,550 INFO L124 PetriNetUnfolderBase]: 202/377 cut-off events. [2024-06-04 18:11:03,551 INFO L125 PetriNetUnfolderBase]: For 4880/4880 co-relation queries the response was YES. [2024-06-04 18:11:03,553 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-04 18:11:03,554 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 64 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2024-06-04 18:11:03,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 83 transitions, 786 flow [2024-06-04 18:11:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:03,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 18:11:03,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 18:11:03,559 INFO L175 Difference]: Start difference. First operand has 94 places, 73 transitions, 598 flow. Second operand 8 states and 81 transitions. [2024-06-04 18:11:03,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 83 transitions, 786 flow [2024-06-04 18:11:03,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 83 transitions, 744 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 18:11:03,568 INFO L231 Difference]: Finished difference. Result has 96 places, 73 transitions, 598 flow [2024-06-04 18:11:03,569 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-04 18:11:03,569 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 67 predicate places. [2024-06-04 18:11:03,570 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 73 transitions, 598 flow [2024-06-04 18:11:03,570 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-04 18:11:03,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:03,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:03,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 18:11:03,570 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:03,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 685484384, now seen corresponding path program 5 times [2024-06-04 18:11:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041294840] [2024-06-04 18:11:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:06,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:06,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:06,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041294840] [2024-06-04 18:11:06,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041294840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:06,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:06,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:06,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095112405] [2024-06-04 18:11:06,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:06,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:06,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:06,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:06,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:06,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:06,713 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-04 18:11:06,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:06,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:06,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:06,936 INFO L124 PetriNetUnfolderBase]: 199/372 cut-off events. [2024-06-04 18:11:06,936 INFO L125 PetriNetUnfolderBase]: For 4921/4921 co-relation queries the response was YES. [2024-06-04 18:11:06,938 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-04 18:11:06,939 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 66 selfloop transitions, 15 changer transitions 0/83 dead transitions. [2024-06-04 18:11:06,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 83 transitions, 784 flow [2024-06-04 18:11:06,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2024-06-04 18:11:06,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:11:06,941 INFO L175 Difference]: Start difference. First operand has 96 places, 73 transitions, 598 flow. Second operand 8 states and 80 transitions. [2024-06-04 18:11:06,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 83 transitions, 784 flow [2024-06-04 18:11:06,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 83 transitions, 704 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 18:11:06,948 INFO L231 Difference]: Finished difference. Result has 95 places, 73 transitions, 554 flow [2024-06-04 18:11:06,948 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-04 18:11:06,949 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-04 18:11:06,949 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 73 transitions, 554 flow [2024-06-04 18:11:06,949 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-04 18:11:06,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:06,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:06,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 18:11:06,950 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:06,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1526560532, now seen corresponding path program 1 times [2024-06-04 18:11:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:06,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972602058] [2024-06-04 18:11:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:09,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:09,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972602058] [2024-06-04 18:11:09,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972602058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:09,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:09,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:09,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658324675] [2024-06-04 18:11:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:09,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:09,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:09,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:10,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:10,122 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-04 18:11:10,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:10,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:10,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:10,400 INFO L124 PetriNetUnfolderBase]: 233/446 cut-off events. [2024-06-04 18:11:10,400 INFO L125 PetriNetUnfolderBase]: For 9227/9227 co-relation queries the response was YES. [2024-06-04 18:11:10,401 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-04 18:11:10,403 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 31 changer transitions 12/101 dead transitions. [2024-06-04 18:11:10,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 882 flow [2024-06-04 18:11:10,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:11:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:11:10,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2024-06-04 18:11:10,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2024-06-04 18:11:10,404 INFO L175 Difference]: Start difference. First operand has 95 places, 73 transitions, 554 flow. Second operand 10 states and 115 transitions. [2024-06-04 18:11:10,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 882 flow [2024-06-04 18:11:10,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 824 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:10,412 INFO L231 Difference]: Finished difference. Result has 98 places, 71 transitions, 552 flow [2024-06-04 18:11:10,413 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-04 18:11:10,413 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-04 18:11:10,413 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 71 transitions, 552 flow [2024-06-04 18:11:10,413 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-04 18:11:10,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:10,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 18:11:10,414 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:10,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1524686582, now seen corresponding path program 2 times [2024-06-04 18:11:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:10,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826397249] [2024-06-04 18:11:10,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:10,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826397249] [2024-06-04 18:11:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826397249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000449962] [2024-06-04 18:11:13,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:13,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:13,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:13,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:13,509 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-04 18:11:13,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:13,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:13,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:13,790 INFO L124 PetriNetUnfolderBase]: 254/493 cut-off events. [2024-06-04 18:11:13,790 INFO L125 PetriNetUnfolderBase]: For 12414/12414 co-relation queries the response was YES. [2024-06-04 18:11:13,791 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-04 18:11:13,797 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 51 selfloop transitions, 33 changer transitions 15/101 dead transitions. [2024-06-04 18:11:13,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 101 transitions, 890 flow [2024-06-04 18:11:13,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:11:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:11:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-04 18:11:13,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-04 18:11:13,799 INFO L175 Difference]: Start difference. First operand has 98 places, 71 transitions, 552 flow. Second operand 10 states and 122 transitions. [2024-06-04 18:11:13,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 101 transitions, 890 flow [2024-06-04 18:11:13,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 851 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:13,810 INFO L231 Difference]: Finished difference. Result has 98 places, 67 transitions, 555 flow [2024-06-04 18:11:13,810 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-04 18:11:13,812 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-04 18:11:13,812 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 67 transitions, 555 flow [2024-06-04 18:11:13,812 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-04 18:11:13,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:13,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 18:11:13,813 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:13,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2029819584, now seen corresponding path program 3 times [2024-06-04 18:11:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648301156] [2024-06-04 18:11:13,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:13,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:17,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:17,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648301156] [2024-06-04 18:11:17,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648301156] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:17,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:17,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:17,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65377251] [2024-06-04 18:11:17,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:17,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:17,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:17,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:17,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:17,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:17,309 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-04 18:11:17,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:17,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:17,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:17,623 INFO L124 PetriNetUnfolderBase]: 235/460 cut-off events. [2024-06-04 18:11:17,623 INFO L125 PetriNetUnfolderBase]: For 10839/10839 co-relation queries the response was YES. [2024-06-04 18:11:17,625 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-04 18:11:17,626 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 46 selfloop transitions, 28 changer transitions 12/88 dead transitions. [2024-06-04 18:11:17,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 88 transitions, 789 flow [2024-06-04 18:11:17,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:11:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:11:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2024-06-04 18:11:17,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37 [2024-06-04 18:11:17,629 INFO L175 Difference]: Start difference. First operand has 98 places, 67 transitions, 555 flow. Second operand 10 states and 111 transitions. [2024-06-04 18:11:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 88 transitions, 789 flow [2024-06-04 18:11:17,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 88 transitions, 714 flow, removed 3 selfloop flow, removed 11 redundant places. [2024-06-04 18:11:17,646 INFO L231 Difference]: Finished difference. Result has 94 places, 64 transitions, 522 flow [2024-06-04 18:11:17,646 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-04 18:11:17,647 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:11:17,647 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 64 transitions, 522 flow [2024-06-04 18:11:17,647 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-04 18:11:17,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:17,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 18:11:17,647 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:17,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1544058816, now seen corresponding path program 4 times [2024-06-04 18:11:17,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:17,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304927288] [2024-06-04 18:11:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:17,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:20,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:20,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:20,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304927288] [2024-06-04 18:11:20,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304927288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:20,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:20,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:20,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442755695] [2024-06-04 18:11:20,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:20,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:20,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:20,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:20,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:20,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:20,787 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-04 18:11:20,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:20,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:21,055 INFO L124 PetriNetUnfolderBase]: 228/451 cut-off events. [2024-06-04 18:11:21,056 INFO L125 PetriNetUnfolderBase]: For 9038/9038 co-relation queries the response was YES. [2024-06-04 18:11:21,057 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-04 18:11:21,059 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 50 selfloop transitions, 28 changer transitions 10/90 dead transitions. [2024-06-04 18:11:21,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 90 transitions, 818 flow [2024-06-04 18:11:21,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 105 transitions. [2024-06-04 18:11:21,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-04 18:11:21,060 INFO L175 Difference]: Start difference. First operand has 94 places, 64 transitions, 522 flow. Second operand 9 states and 105 transitions. [2024-06-04 18:11:21,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 90 transitions, 818 flow [2024-06-04 18:11:21,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 751 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-04 18:11:21,067 INFO L231 Difference]: Finished difference. Result has 91 places, 62 transitions, 501 flow [2024-06-04 18:11:21,067 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-04 18:11:21,067 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-04 18:11:21,067 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 62 transitions, 501 flow [2024-06-04 18:11:21,068 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-04 18:11:21,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:21,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:21,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 18:11:21,068 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:21,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1544062536, now seen corresponding path program 5 times [2024-06-04 18:11:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719178417] [2024-06-04 18:11:21,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:24,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719178417] [2024-06-04 18:11:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719178417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88373130] [2024-06-04 18:11:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:24,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:24,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:24,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:24,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:24,092 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-04 18:11:24,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:24,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:24,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:24,356 INFO L124 PetriNetUnfolderBase]: 222/439 cut-off events. [2024-06-04 18:11:24,356 INFO L125 PetriNetUnfolderBase]: For 9217/9217 co-relation queries the response was YES. [2024-06-04 18:11:24,358 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-04 18:11:24,360 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 44 selfloop transitions, 29 changer transitions 8/83 dead transitions. [2024-06-04 18:11:24,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 83 transitions, 729 flow [2024-06-04 18:11:24,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-04 18:11:24,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-04 18:11:24,362 INFO L175 Difference]: Start difference. First operand has 91 places, 62 transitions, 501 flow. Second operand 9 states and 102 transitions. [2024-06-04 18:11:24,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 83 transitions, 729 flow [2024-06-04 18:11:24,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 83 transitions, 677 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-04 18:11:24,369 INFO L231 Difference]: Finished difference. Result has 90 places, 59 transitions, 482 flow [2024-06-04 18:11:24,369 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-04 18:11:24,370 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-04 18:11:24,371 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 59 transitions, 482 flow [2024-06-04 18:11:24,371 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-04 18:11:24,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:24,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:24,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 18:11:24,371 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:24,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:24,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2136179368, now seen corresponding path program 6 times [2024-06-04 18:11:24,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:24,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41845764] [2024-06-04 18:11:24,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:24,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:27,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:27,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41845764] [2024-06-04 18:11:27,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41845764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:27,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:27,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578377550] [2024-06-04 18:11:27,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:27,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:27,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:27,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:27,257 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-04 18:11:27,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:27,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:27,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:27,526 INFO L124 PetriNetUnfolderBase]: 195/389 cut-off events. [2024-06-04 18:11:27,527 INFO L125 PetriNetUnfolderBase]: For 7052/7052 co-relation queries the response was YES. [2024-06-04 18:11:27,528 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-04 18:11:27,529 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 37 selfloop transitions, 23 changer transitions 14/76 dead transitions. [2024-06-04 18:11:27,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 76 transitions, 678 flow [2024-06-04 18:11:27,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-04 18:11:27,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 18:11:27,530 INFO L175 Difference]: Start difference. First operand has 90 places, 59 transitions, 482 flow. Second operand 8 states and 90 transitions. [2024-06-04 18:11:27,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 76 transitions, 678 flow [2024-06-04 18:11:27,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 76 transitions, 594 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:11:27,536 INFO L231 Difference]: Finished difference. Result has 87 places, 52 transitions, 396 flow [2024-06-04 18:11:27,536 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-04 18:11:27,536 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 58 predicate places. [2024-06-04 18:11:27,536 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 52 transitions, 396 flow [2024-06-04 18:11:27,537 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-04 18:11:27,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:27,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:27,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 18:11:27,537 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:27,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1506788318, now seen corresponding path program 1 times [2024-06-04 18:11:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:27,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850764000] [2024-06-04 18:11:27,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:27,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:30,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:30,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850764000] [2024-06-04 18:11:30,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850764000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:30,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:30,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:30,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097538288] [2024-06-04 18:11:30,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:30,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:30,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:30,796 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-04 18:11:30,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:30,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:30,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:31,007 INFO L124 PetriNetUnfolderBase]: 163/337 cut-off events. [2024-06-04 18:11:31,008 INFO L125 PetriNetUnfolderBase]: For 5916/5916 co-relation queries the response was YES. [2024-06-04 18:11:31,009 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-04 18:11:31,010 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 41 selfloop transitions, 22 changer transitions 0/65 dead transitions. [2024-06-04 18:11:31,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 65 transitions, 560 flow [2024-06-04 18:11:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 88 transitions. [2024-06-04 18:11:31,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32592592592592595 [2024-06-04 18:11:31,011 INFO L175 Difference]: Start difference. First operand has 87 places, 52 transitions, 396 flow. Second operand 9 states and 88 transitions. [2024-06-04 18:11:31,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 65 transitions, 560 flow [2024-06-04 18:11:31,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 65 transitions, 500 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:31,017 INFO L231 Difference]: Finished difference. Result has 86 places, 53 transitions, 394 flow [2024-06-04 18:11:31,017 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-04 18:11:31,018 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 57 predicate places. [2024-06-04 18:11:31,018 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 53 transitions, 394 flow [2024-06-04 18:11:31,018 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-04 18:11:31,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:31,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:31,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 18:11:31,018 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:31,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1506780878, now seen corresponding path program 2 times [2024-06-04 18:11:31,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747872981] [2024-06-04 18:11:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:34,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:34,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747872981] [2024-06-04 18:11:34,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747872981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:34,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:34,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238136135] [2024-06-04 18:11:34,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:34,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:34,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:34,222 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-04 18:11:34,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:34,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:34,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:34,414 INFO L124 PetriNetUnfolderBase]: 167/345 cut-off events. [2024-06-04 18:11:34,415 INFO L125 PetriNetUnfolderBase]: For 5906/5906 co-relation queries the response was YES. [2024-06-04 18:11:34,416 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-04 18:11:34,417 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 39 selfloop transitions, 25 changer transitions 0/66 dead transitions. [2024-06-04 18:11:34,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 66 transitions, 560 flow [2024-06-04 18:11:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2024-06-04 18:11:34,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3296296296296296 [2024-06-04 18:11:34,418 INFO L175 Difference]: Start difference. First operand has 86 places, 53 transitions, 394 flow. Second operand 9 states and 89 transitions. [2024-06-04 18:11:34,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 66 transitions, 560 flow [2024-06-04 18:11:34,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 66 transitions, 512 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:34,425 INFO L231 Difference]: Finished difference. Result has 88 places, 54 transitions, 413 flow [2024-06-04 18:11:34,425 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-04 18:11:34,425 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2024-06-04 18:11:34,425 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 54 transitions, 413 flow [2024-06-04 18:11:34,425 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-04 18:11:34,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:34,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:34,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:11:34,426 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:34,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1244767538, now seen corresponding path program 3 times [2024-06-04 18:11:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073438923] [2024-06-04 18:11:34,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073438923] [2024-06-04 18:11:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073438923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:37,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799600755] [2024-06-04 18:11:37,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:37,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:37,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:37,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:37,503 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-04 18:11:37,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:37,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:37,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:37,680 INFO L124 PetriNetUnfolderBase]: 164/340 cut-off events. [2024-06-04 18:11:37,680 INFO L125 PetriNetUnfolderBase]: For 5996/5996 co-relation queries the response was YES. [2024-06-04 18:11:37,681 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-04 18:11:37,682 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 50 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2024-06-04 18:11:37,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 69 transitions, 645 flow [2024-06-04 18:11:37,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 90 transitions. [2024-06-04 18:11:37,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-04 18:11:37,683 INFO L175 Difference]: Start difference. First operand has 88 places, 54 transitions, 413 flow. Second operand 9 states and 90 transitions. [2024-06-04 18:11:37,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 69 transitions, 645 flow [2024-06-04 18:11:37,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 69 transitions, 590 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:37,690 INFO L231 Difference]: Finished difference. Result has 90 places, 56 transitions, 423 flow [2024-06-04 18:11:37,690 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-04 18:11:37,690 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 61 predicate places. [2024-06-04 18:11:37,691 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 56 transitions, 423 flow [2024-06-04 18:11:37,691 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-04 18:11:37,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:37,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:37,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:11:37,691 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:37,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:37,692 INFO L85 PathProgramCache]: Analyzing trace with hash -215623374, now seen corresponding path program 4 times [2024-06-04 18:11:37,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:37,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760468615] [2024-06-04 18:11:37,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:37,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:40,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:40,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760468615] [2024-06-04 18:11:40,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760468615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:40,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:40,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:40,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001963510] [2024-06-04 18:11:40,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:40,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:40,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:40,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:40,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:40,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:40,608 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-04 18:11:40,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:40,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:40,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:40,774 INFO L124 PetriNetUnfolderBase]: 161/335 cut-off events. [2024-06-04 18:11:40,774 INFO L125 PetriNetUnfolderBase]: For 6017/6017 co-relation queries the response was YES. [2024-06-04 18:11:40,775 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-04 18:11:40,776 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 12 changer transitions 0/68 dead transitions. [2024-06-04 18:11:40,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 68 transitions, 581 flow [2024-06-04 18:11:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2024-06-04 18:11:40,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31851851851851853 [2024-06-04 18:11:40,777 INFO L175 Difference]: Start difference. First operand has 90 places, 56 transitions, 423 flow. Second operand 9 states and 86 transitions. [2024-06-04 18:11:40,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 68 transitions, 581 flow [2024-06-04 18:11:40,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 68 transitions, 551 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:40,783 INFO L231 Difference]: Finished difference. Result has 94 places, 56 transitions, 421 flow [2024-06-04 18:11:40,784 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-04 18:11:40,784 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:11:40,784 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 56 transitions, 421 flow [2024-06-04 18:11:40,784 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-04 18:11:40,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:40,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:40,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:11:40,785 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:40,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash -224827584, now seen corresponding path program 5 times [2024-06-04 18:11:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165089788] [2024-06-04 18:11:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165089788] [2024-06-04 18:11:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165089788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:43,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:43,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:11:43,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944987192] [2024-06-04 18:11:43,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:11:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:11:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:11:43,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:43,753 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-04 18:11:43,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:43,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:43,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:43,935 INFO L124 PetriNetUnfolderBase]: 158/330 cut-off events. [2024-06-04 18:11:43,936 INFO L125 PetriNetUnfolderBase]: For 5899/5899 co-relation queries the response was YES. [2024-06-04 18:11:43,937 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-04 18:11:43,937 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 50 selfloop transitions, 15 changer transitions 0/67 dead transitions. [2024-06-04 18:11:43,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 67 transitions, 579 flow [2024-06-04 18:11:43,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:43,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2024-06-04 18:11:43,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3375 [2024-06-04 18:11:43,939 INFO L175 Difference]: Start difference. First operand has 94 places, 56 transitions, 421 flow. Second operand 8 states and 81 transitions. [2024-06-04 18:11:43,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 67 transitions, 579 flow [2024-06-04 18:11:43,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 67 transitions, 521 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-04 18:11:43,946 INFO L231 Difference]: Finished difference. Result has 93 places, 56 transitions, 398 flow [2024-06-04 18:11:43,946 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-04 18:11:43,946 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-06-04 18:11:43,946 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 56 transitions, 398 flow [2024-06-04 18:11:43,947 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-04 18:11:43,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:43,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:43,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:11:43,947 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:43,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1623396027, now seen corresponding path program 1 times [2024-06-04 18:11:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:43,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428072814] [2024-06-04 18:11:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:47,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:47,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:47,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428072814] [2024-06-04 18:11:47,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428072814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:47,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:47,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:47,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660898147] [2024-06-04 18:11:47,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:47,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:47,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:47,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:47,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:47,243 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:47,243 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-04 18:11:47,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:47,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:47,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:47,399 INFO L124 PetriNetUnfolderBase]: 196/418 cut-off events. [2024-06-04 18:11:47,399 INFO L125 PetriNetUnfolderBase]: For 7750/7750 co-relation queries the response was YES. [2024-06-04 18:11:47,400 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-04 18:11:47,401 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 54 selfloop transitions, 21 changer transitions 7/84 dead transitions. [2024-06-04 18:11:47,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 84 transitions, 685 flow [2024-06-04 18:11:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:47,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-04 18:11:47,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2024-06-04 18:11:47,403 INFO L175 Difference]: Start difference. First operand has 93 places, 56 transitions, 398 flow. Second operand 9 states and 95 transitions. [2024-06-04 18:11:47,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 84 transitions, 685 flow [2024-06-04 18:11:47,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 84 transitions, 649 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 18:11:47,412 INFO L231 Difference]: Finished difference. Result has 99 places, 65 transitions, 506 flow [2024-06-04 18:11:47,412 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-04 18:11:47,413 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-04 18:11:47,413 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 65 transitions, 506 flow [2024-06-04 18:11:47,413 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-04 18:11:47,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:47,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:47,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 18:11:47,414 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:47,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:47,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1705764937, now seen corresponding path program 2 times [2024-06-04 18:11:47,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820520205] [2024-06-04 18:11:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:47,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:50,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:50,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:50,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820520205] [2024-06-04 18:11:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820520205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637729781] [2024-06-04 18:11:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:50,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:50,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:50,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:50,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:50,962 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-04 18:11:50,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:50,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:50,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:51,169 INFO L124 PetriNetUnfolderBase]: 187/399 cut-off events. [2024-06-04 18:11:51,169 INFO L125 PetriNetUnfolderBase]: For 8477/8477 co-relation queries the response was YES. [2024-06-04 18:11:51,170 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-04 18:11:51,171 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 24 changer transitions 8/83 dead transitions. [2024-06-04 18:11:51,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 83 transitions, 726 flow [2024-06-04 18:11:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:51,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:51,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-04 18:11:51,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-04 18:11:51,173 INFO L175 Difference]: Start difference. First operand has 99 places, 65 transitions, 506 flow. Second operand 9 states and 96 transitions. [2024-06-04 18:11:51,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 83 transitions, 726 flow [2024-06-04 18:11:51,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 83 transitions, 709 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-04 18:11:51,182 INFO L231 Difference]: Finished difference. Result has 104 places, 62 transitions, 521 flow [2024-06-04 18:11:51,182 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-04 18:11:51,182 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 75 predicate places. [2024-06-04 18:11:51,182 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 62 transitions, 521 flow [2024-06-04 18:11:51,182 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-04 18:11:51,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:51,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:51,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 18:11:51,183 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:51,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1659216959, now seen corresponding path program 3 times [2024-06-04 18:11:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:51,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697523783] [2024-06-04 18:11:51,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:51,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:54,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:54,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697523783] [2024-06-04 18:11:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697523783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:54,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746263197] [2024-06-04 18:11:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:54,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:54,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:54,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:54,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:54,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:54,691 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-04 18:11:54,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:54,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:54,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:54,907 INFO L124 PetriNetUnfolderBase]: 180/381 cut-off events. [2024-06-04 18:11:54,907 INFO L125 PetriNetUnfolderBase]: For 8568/8568 co-relation queries the response was YES. [2024-06-04 18:11:54,908 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-04 18:11:54,909 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 56 selfloop transitions, 9 changer transitions 15/82 dead transitions. [2024-06-04 18:11:54,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 82 transitions, 743 flow [2024-06-04 18:11:54,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:11:54,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:11:54,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2024-06-04 18:11:54,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32 [2024-06-04 18:11:54,910 INFO L175 Difference]: Start difference. First operand has 104 places, 62 transitions, 521 flow. Second operand 10 states and 96 transitions. [2024-06-04 18:11:54,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 82 transitions, 743 flow [2024-06-04 18:11:54,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 82 transitions, 625 flow, removed 9 selfloop flow, removed 12 redundant places. [2024-06-04 18:11:54,918 INFO L231 Difference]: Finished difference. Result has 102 places, 58 transitions, 401 flow [2024-06-04 18:11:54,919 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-04 18:11:54,920 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-04 18:11:54,920 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 58 transitions, 401 flow [2024-06-04 18:11:54,920 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-04 18:11:54,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:54,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:54,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 18:11:54,920 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:54,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:54,921 INFO L85 PathProgramCache]: Analyzing trace with hash -760425475, now seen corresponding path program 4 times [2024-06-04 18:11:54,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:54,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284593854] [2024-06-04 18:11:54,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:58,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:11:58,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:58,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284593854] [2024-06-04 18:11:58,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284593854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:58,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:58,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:58,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198742761] [2024-06-04 18:11:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:58,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:58,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:11:58,448 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-04 18:11:58,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:58,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:11:58,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:58,622 INFO L124 PetriNetUnfolderBase]: 165/352 cut-off events. [2024-06-04 18:11:58,623 INFO L125 PetriNetUnfolderBase]: For 8325/8325 co-relation queries the response was YES. [2024-06-04 18:11:58,623 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-04 18:11:58,624 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 39 selfloop transitions, 15 changer transitions 19/75 dead transitions. [2024-06-04 18:11:58,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 75 transitions, 593 flow [2024-06-04 18:11:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:11:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:11:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 92 transitions. [2024-06-04 18:11:58,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34074074074074073 [2024-06-04 18:11:58,625 INFO L175 Difference]: Start difference. First operand has 102 places, 58 transitions, 401 flow. Second operand 9 states and 92 transitions. [2024-06-04 18:11:58,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 75 transitions, 593 flow [2024-06-04 18:11:58,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 75 transitions, 555 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-04 18:11:58,649 INFO L231 Difference]: Finished difference. Result has 100 places, 53 transitions, 369 flow [2024-06-04 18:11:58,650 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-04 18:11:58,652 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-06-04 18:11:58,652 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 53 transitions, 369 flow [2024-06-04 18:11:58,652 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-04 18:11:58,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:58,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:58,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 18:11:58,657 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:11:58,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash 542080189, now seen corresponding path program 5 times [2024-06-04 18:11:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247474604] [2024-06-04 18:11:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:02,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:02,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:02,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247474604] [2024-06-04 18:12:02,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247474604] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:02,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:02,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:12:02,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562989687] [2024-06-04 18:12:02,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:02,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:12:02,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:02,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:12:02,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:12:02,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:02,375 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-04 18:12:02,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:02,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:02,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:02,523 INFO L124 PetriNetUnfolderBase]: 147/306 cut-off events. [2024-06-04 18:12:02,523 INFO L125 PetriNetUnfolderBase]: For 6958/6958 co-relation queries the response was YES. [2024-06-04 18:12:02,524 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-04 18:12:02,525 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 41 selfloop transitions, 23 changer transitions 0/66 dead transitions. [2024-06-04 18:12:02,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 66 transitions, 531 flow [2024-06-04 18:12:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:12:02,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:12:02,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2024-06-04 18:12:02,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31333333333333335 [2024-06-04 18:12:02,526 INFO L175 Difference]: Start difference. First operand has 100 places, 53 transitions, 369 flow. Second operand 10 states and 94 transitions. [2024-06-04 18:12:02,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 66 transitions, 531 flow [2024-06-04 18:12:02,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 66 transitions, 477 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-04 18:12:02,532 INFO L231 Difference]: Finished difference. Result has 94 places, 54 transitions, 371 flow [2024-06-04 18:12:02,532 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-04 18:12:02,533 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:12:02,533 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 54 transitions, 371 flow [2024-06-04 18:12:02,533 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-04 18:12:02,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:02,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:02,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 18:12:02,534 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:02,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 798672515, now seen corresponding path program 6 times [2024-06-04 18:12:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:02,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035025906] [2024-06-04 18:12:02,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:02,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:05,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:05,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035025906] [2024-06-04 18:12:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035025906] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:05,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:05,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284344325] [2024-06-04 18:12:05,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:05,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:05,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:05,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:05,782 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-04 18:12:05,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:05,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:05,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:05,947 INFO L124 PetriNetUnfolderBase]: 140/293 cut-off events. [2024-06-04 18:12:05,947 INFO L125 PetriNetUnfolderBase]: For 6138/6138 co-relation queries the response was YES. [2024-06-04 18:12:05,948 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-04 18:12:05,949 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 33 selfloop transitions, 15 changer transitions 16/66 dead transitions. [2024-06-04 18:12:05,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 66 transitions, 529 flow [2024-06-04 18:12:05,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:12:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:12:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2024-06-04 18:12:05,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32222222222222224 [2024-06-04 18:12:05,950 INFO L175 Difference]: Start difference. First operand has 94 places, 54 transitions, 371 flow. Second operand 9 states and 87 transitions. [2024-06-04 18:12:05,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 66 transitions, 529 flow [2024-06-04 18:12:05,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 66 transitions, 477 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-04 18:12:05,956 INFO L231 Difference]: Finished difference. Result has 94 places, 44 transitions, 293 flow [2024-06-04 18:12:05,956 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-04 18:12:05,956 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-04 18:12:05,957 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 44 transitions, 293 flow [2024-06-04 18:12:05,957 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-04 18:12:05,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:05,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:05,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:12:05,957 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:05,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:05,958 INFO L85 PathProgramCache]: Analyzing trace with hash 625951985, now seen corresponding path program 7 times [2024-06-04 18:12:05,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:05,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533815105] [2024-06-04 18:12:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:05,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:05,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:09,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:09,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533815105] [2024-06-04 18:12:09,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533815105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:09,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:09,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:09,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614783888] [2024-06-04 18:12:09,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:09,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:09,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:09,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:09,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:09,367 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-04 18:12:09,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:09,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:09,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:09,509 INFO L124 PetriNetUnfolderBase]: 93/204 cut-off events. [2024-06-04 18:12:09,509 INFO L125 PetriNetUnfolderBase]: For 4195/4195 co-relation queries the response was YES. [2024-06-04 18:12:09,510 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-04 18:12:09,511 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 17 selfloop transitions, 3 changer transitions 33/55 dead transitions. [2024-06-04 18:12:09,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 55 transitions, 427 flow [2024-06-04 18:12:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 79 transitions. [2024-06-04 18:12:09,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32916666666666666 [2024-06-04 18:12:09,512 INFO L175 Difference]: Start difference. First operand has 94 places, 44 transitions, 293 flow. Second operand 8 states and 79 transitions. [2024-06-04 18:12:09,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 55 transitions, 427 flow [2024-06-04 18:12:09,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 55 transitions, 385 flow, removed 6 selfloop flow, removed 12 redundant places. [2024-06-04 18:12:09,515 INFO L231 Difference]: Finished difference. Result has 82 places, 21 transitions, 124 flow [2024-06-04 18:12:09,515 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-04 18:12:09,516 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-06-04 18:12:09,516 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 21 transitions, 124 flow [2024-06-04 18:12:09,516 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-04 18:12:09,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:09,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:09,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 18:12:09,518 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-04 18:12:09,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:09,518 INFO L85 PathProgramCache]: Analyzing trace with hash 305172607, now seen corresponding path program 8 times [2024-06-04 18:12:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415490208] [2024-06-04 18:12:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:12,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:12:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:12,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415490208] [2024-06-04 18:12:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415490208] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:12,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:12,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:12,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348019854] [2024-06-04 18:12:12,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:12,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:12,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:12,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:12,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:12,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-04 18:12:12,719 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-04 18:12:12,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:12,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-04 18:12:12,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:12,815 INFO L124 PetriNetUnfolderBase]: 25/65 cut-off events. [2024-06-04 18:12:12,815 INFO L125 PetriNetUnfolderBase]: For 1335/1335 co-relation queries the response was YES. [2024-06-04 18:12:12,815 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-04 18:12:12,816 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2024-06-04 18:12:12,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 27 transitions, 144 flow [2024-06-04 18:12:12,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:12:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:12:12,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2024-06-04 18:12:12,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.275 [2024-06-04 18:12:12,817 INFO L175 Difference]: Start difference. First operand has 82 places, 21 transitions, 124 flow. Second operand 8 states and 66 transitions. [2024-06-04 18:12:12,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 27 transitions, 144 flow [2024-06-04 18:12:12,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 27 transitions, 110 flow, removed 1 selfloop flow, removed 16 redundant places. [2024-06-04 18:12:12,817 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2024-06-04 18:12:12,817 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-04 18:12:12,818 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-04 18:12:12,818 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 0 transitions, 0 flow [2024-06-04 18:12:12,818 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-04 18:12:12,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-04 18:12:12,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-04 18:12:12,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-04 18:12:12,821 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-04 18:12:12,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 18:12:12,822 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-04 18:12:12,824 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-04 18:12:12,824 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-04 18:12:12,827 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-04 18:12:12,828 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-04 18:12:12,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.06 06:12:12 BasicIcfg [2024-06-04 18:12:12,828 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-04 18:12:12,829 INFO L158 Benchmark]: Toolchain (without parser) took 148010.63ms. Allocated memory was 192.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 113.9MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 401.6MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,829 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 192.9MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:12:12,829 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-04 18:12:12,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.21ms. Allocated memory is still 192.9MB. Free memory was 113.7MB in the beginning and 134.5MB in the end (delta: -20.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.69ms. Allocated memory is still 192.9MB. Free memory was 134.5MB in the beginning and 121.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,830 INFO L158 Benchmark]: Boogie Preprocessor took 90.81ms. Allocated memory is still 192.9MB. Free memory was 121.3MB in the beginning and 115.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,830 INFO L158 Benchmark]: RCFGBuilder took 880.71ms. Allocated memory is still 192.9MB. Free memory was 115.9MB in the beginning and 65.2MB in the end (delta: 50.7MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,830 INFO L158 Benchmark]: TraceAbstraction took 146195.60ms. Allocated memory was 291.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 247.7MB in the beginning and 1.1GB in the end (delta: -897.0MB). Peak memory consumption was 434.8MB. Max. memory is 16.1GB. [2024-06-04 18:12:12,831 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 192.9MB. Free memory was 148.9MB in the beginning and 148.8MB in the end (delta: 119.1kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory was 159.9MB in the beginning and 159.8MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.21ms. Allocated memory is still 192.9MB. Free memory was 113.7MB in the beginning and 134.5MB in the end (delta: -20.8MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.69ms. Allocated memory is still 192.9MB. Free memory was 134.5MB in the beginning and 121.3MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.81ms. Allocated memory is still 192.9MB. Free memory was 121.3MB in the beginning and 115.9MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 880.71ms. Allocated memory is still 192.9MB. Free memory was 115.9MB in the beginning and 65.2MB in the end (delta: 50.7MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. * TraceAbstraction took 146195.60ms. Allocated memory was 291.5MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 247.7MB in the beginning and 1.1GB in the end (delta: -897.0MB). Peak memory consumption was 434.8MB. 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: 146.1s, OverallIterations: 46, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 13.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2044 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1698 mSDsluCounter, 1121 SdHoareTripleChecker+Invalid, 7.4s 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.7s 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, 130.6s 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-04 18:12:12,894 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