./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 22:19:20,849 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 22:19:20,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 22:19:20,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 22:19:20,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 22:19:20,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 22:19:20,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 22:19:20,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 22:19:20,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 22:19:20,963 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 22:19:20,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 22:19:20,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 22:19:20,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 22:19:20,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 22:19:20,965 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 22:19:20,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 22:19:20,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 22:19:20,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 22:19:20,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 22:19:20,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 22:19:20,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 22:19:20,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 22:19:20,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 22:19:20,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 22:19:20,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 22:19:20,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 22:19:20,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 22:19:20,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 22:19:20,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 22:19:20,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 22:19:20,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 22:19:20,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 22:19:20,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:19:20,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 22:19:20,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 22:19:20,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 22:19:20,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 22:19:20,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 22:19:20,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 22:19:20,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 22:19:20,971 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 22:19:20,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 22:19:20,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 22:19:20,972 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 22:19:21,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 22:19:21,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 22:19:21,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 22:19:21,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 22:19:21,219 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 22:19:21,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:19:22,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 22:19:22,472 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 22:19:22,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:19:22,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41d9b2af/b8f40c27c2d145f299a3db0f7715f060/FLAGbdcd0ebb1 [2024-06-03 22:19:22,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41d9b2af/b8f40c27c2d145f299a3db0f7715f060 [2024-06-03 22:19:22,497 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 22:19:22,498 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 22:19:22,498 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/rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-03 22:19:22,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 22:19:22,620 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 22:19:22,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 22:19:22,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 22:19:22,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 22:19:22,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:19:22" (1/2) ... [2024-06-03 22:19:22,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c650e75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:19:22, skipping insertion in model container [2024-06-03 22:19:22,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 10:19:22" (1/2) ... [2024-06-03 22:19:22,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4004e816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 10:19:22, skipping insertion in model container [2024-06-03 22:19:22,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:19:22" (2/2) ... [2024-06-03 22:19:22,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c650e75 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:22, skipping insertion in model container [2024-06-03 22:19:22,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:19:22" (2/2) ... [2024-06-03 22:19:22,628 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 22:19:22,681 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 22:19:22,682 INFO L97 edCorrectnessWitness]: Location invariant before [L813-L813] (((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:19:22,682 INFO L97 edCorrectnessWitness]: Location invariant before [L814-L814] (((((((((((((((! multithreaded || ((0 <= x$w_buff1 && x$w_buff1 <= 1) && (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || ((0 <= x$w_buff0 && x$w_buff0 <= 1) && (x$w_buff0 == 0 || x$w_buff0 == 1)))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff0_thd2 >= 0LL && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) + (long long )y >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd1) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )y >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$read_delayed) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd1) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$w_buff0) + (long long )y >= 0LL) && (1LL - (long long )x$w_buff1) + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )x$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )x$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )x$flush_delayed >= 0LL) && (long long )x + (long long )x$mem_tmp >= 0LL) && (long long )x + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x + (long long )x$read_delayed >= 0LL) && (long long )x + (long long )x$w_buff0 >= 0LL) && (long long )x + (long long )x$w_buff1 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x$flush_delayed + (long long )x$mem_tmp >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed + (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$flush_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$flush_delayed + (long long )y >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp + (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff0 >= 0LL) && (long long )x$mem_tmp + (long long )x$w_buff1 >= 0LL) && (long long )x$mem_tmp + (long long )y >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd0 + (long long )y >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff0_thd2 + (long long )y >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd0 + (long long )y >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff0 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )x$w_buff1 >= 0LL) && (long long )x$r_buff1_thd2 + (long long )y >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff0 >= 0LL) && (long long )x$read_delayed + (long long )x$w_buff1 >= 0LL) && (long long )x$read_delayed + (long long )y >= 0LL) && (long long )x$w_buff0 + (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 + (long long )y >= 0LL) && (long long )x$w_buff1 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$flush_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$mem_tmp) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd0 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff0_thd2) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd2 >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$read_delayed >= 0LL) && (0LL - (long long )x$r_buff1_thd2) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff0_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )x$r_buff1_thd1) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff0 >= 0LL) && (1LL - (long long )x$read_delayed) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$r_buff1_thd1 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff0 >= 0LL) && (2LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1 >= 0LL) && (2LL - (long long )x$w_buff0) - (long long )x$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )x$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )x$read_delayed >= 0LL) && (long long )x - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x - (long long )x$read_delayed >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$flush_delayed - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$flush_delayed - (long long )x$read_delayed >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$mem_tmp - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$mem_tmp - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$read_delayed >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$read_delayed >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )x$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )x$read_delayed >= 0LL))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || ((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= x$mem_tmp) && 0 <= x$w_buff0) && 0 <= x$w_buff1) && 0 <= y) && __unbuffered_p1_EBX <= 1) && x <= 1) && x$mem_tmp <= 1) && x$w_buff0 <= 1) && x$w_buff1 <= 1) && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd2 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd2 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || x$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || x$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= x$mem_tmp && x$mem_tmp <= 1) && (x$mem_tmp == 0 || x$mem_tmp == 1)))) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-03 22:19:22,683 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 22:19:22,683 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-03 22:19:22,719 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 22:19:23,031 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:19:23,040 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 22:19:23,300 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 22:19:23,333 INFO L206 MainTranslator]: Completed translation [2024-06-03 22:19:23,333 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23 WrapperNode [2024-06-03 22:19:23,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 22:19:23,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 22:19:23,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 22:19:23,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 22:19:23,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,429 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-03 22:19:23,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 22:19:23,430 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 22:19:23,430 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 22:19:23,430 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 22:19:23,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,479 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-03 22:19:23,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 22:19:23,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 22:19:23,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 22:19:23,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 22:19:23,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (1/1) ... [2024-06-03 22:19:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 22:19:23,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 22:19:23,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 22:19:23,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 22:19:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-03 22:19:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 22:19:23,594 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-03 22:19:23,594 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-03 22:19:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-03 22:19:23,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-03 22:19:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 22:19:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-03 22:19:23,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 22:19:23,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 22:19:23,596 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 22:19:23,720 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 22:19:23,722 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 22:19:24,379 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 22:19:24,379 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 22:19:24,526 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 22:19:24,526 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-03 22:19:24,528 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:19:24 BoogieIcfgContainer [2024-06-03 22:19:24,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 22:19:24,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 22:19:24,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 22:19:24,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 22:19:24,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 10:19:22" (1/4) ... [2024-06-03 22:19:24,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cea6306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 10:19:24, skipping insertion in model container [2024-06-03 22:19:24,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 10:19:22" (2/4) ... [2024-06-03 22:19:24,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cea6306 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:19:24, skipping insertion in model container [2024-06-03 22:19:24,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 10:19:23" (3/4) ... [2024-06-03 22:19:24,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cea6306 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 10:19:24, skipping insertion in model container [2024-06-03 22:19:24,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 10:19:24" (4/4) ... [2024-06-03 22:19:24,539 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-03 22:19:24,551 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 22:19:24,551 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 22:19:24,551 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 22:19:24,608 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-03 22:19:24,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:19:24,678 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-06-03 22:19:24,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:19:24,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-03 22:19:24,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 31 transitions, 70 flow [2024-06-03 22:19:24,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 52 flow [2024-06-03 22:19:24,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 22:19:24,701 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;@2f5176e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 22:19:24,701 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 22:19:24,706 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 22:19:24,707 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 22:19:24,707 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 22:19:24,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:24,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 22:19:24,708 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:24,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1505849308, now seen corresponding path program 1 times [2024-06-03 22:19:24,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:24,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525735119] [2024-06-03 22:19:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:24,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525735119] [2024-06-03 22:19:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525735119] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 22:19:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136475144] [2024-06-03 22:19:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 22:19:28,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:28,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 22:19:28,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 22:19:28,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:19:28,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:28,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:28,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:19:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:28,650 INFO L124 PetriNetUnfolderBase]: 162/307 cut-off events. [2024-06-03 22:19:28,650 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-03 22:19:28,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 307 events. 162/307 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1113 event pairs, 97 based on Foata normal form. 1/301 useless extension candidates. Maximal degree in co-relation 606. Up to 288 conditions per place. [2024-06-03 22:19:28,655 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 23 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2024-06-03 22:19:28,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 119 flow [2024-06-03 22:19:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 22:19:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 22:19:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-06-03 22:19:28,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-06-03 22:19:28,666 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 52 flow. Second operand 3 states and 52 transitions. [2024-06-03 22:19:28,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 119 flow [2024-06-03 22:19:28,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 22:19:28,670 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 71 flow [2024-06-03 22:19:28,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2024-06-03 22:19:28,674 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2024-06-03 22:19:28,674 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 71 flow [2024-06-03 22:19:28,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:28,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:28,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:28,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 22:19:28,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:28,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:28,676 INFO L85 PathProgramCache]: Analyzing trace with hash -282759621, now seen corresponding path program 1 times [2024-06-03 22:19:28,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:28,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160963346] [2024-06-03 22:19:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:31,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160963346] [2024-06-03 22:19:31,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160963346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:31,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:31,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-03 22:19:31,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154431461] [2024-06-03 22:19:31,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:31,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-03 22:19:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:31,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-03 22:19:31,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-03 22:19:31,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2024-06-03 22:19:31,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:31,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:31,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2024-06-03 22:19:31,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:31,566 INFO L124 PetriNetUnfolderBase]: 159/304 cut-off events. [2024-06-03 22:19:31,566 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-03 22:19:31,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 304 events. 159/304 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1089 event pairs, 79 based on Foata normal form. 2/306 useless extension candidates. Maximal degree in co-relation 679. Up to 274 conditions per place. [2024-06-03 22:19:31,568 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 27 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-06-03 22:19:31,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 161 flow [2024-06-03 22:19:31,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-03 22:19:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-03 22:19:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-06-03 22:19:31,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-06-03 22:19:31,570 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 71 flow. Second operand 4 states and 66 transitions. [2024-06-03 22:19:31,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 161 flow [2024-06-03 22:19:31,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 22:19:31,572 INFO L231 Difference]: Finished difference. Result has 34 places, 27 transitions, 95 flow [2024-06-03 22:19:31,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=95, PETRI_PLACES=34, PETRI_TRANSITIONS=27} [2024-06-03 22:19:31,572 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2024-06-03 22:19:31,573 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 27 transitions, 95 flow [2024-06-03 22:19:31,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:31,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:31,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:31,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-03 22:19:31,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:31,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:31,574 INFO L85 PathProgramCache]: Analyzing trace with hash -175612531, now seen corresponding path program 1 times [2024-06-03 22:19:31,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:31,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351220702] [2024-06-03 22:19:31,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:31,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:34,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:34,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351220702] [2024-06-03 22:19:34,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351220702] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:34,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:34,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 22:19:34,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381928615] [2024-06-03 22:19:34,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:34,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 22:19:34,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:34,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 22:19:34,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 22:19:34,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:19:34,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:34,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:19:34,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:34,341 INFO L124 PetriNetUnfolderBase]: 187/339 cut-off events. [2024-06-03 22:19:34,341 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-03 22:19:34,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869 conditions, 339 events. 187/339 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1188 event pairs, 67 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 852. Up to 293 conditions per place. [2024-06-03 22:19:34,345 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 36 selfloop transitions, 11 changer transitions 0/49 dead transitions. [2024-06-03 22:19:34,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 49 transitions, 255 flow [2024-06-03 22:19:34,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:19:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:19:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2024-06-03 22:19:34,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5290322580645161 [2024-06-03 22:19:34,349 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 95 flow. Second operand 5 states and 82 transitions. [2024-06-03 22:19:34,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 49 transitions, 255 flow [2024-06-03 22:19:34,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 49 transitions, 246 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-03 22:19:34,353 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 162 flow [2024-06-03 22:19:34,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2024-06-03 22:19:34,354 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 9 predicate places. [2024-06-03 22:19:34,355 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 162 flow [2024-06-03 22:19:34,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:34,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:34,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:34,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-03 22:19:34,356 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:34,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1149020006, now seen corresponding path program 1 times [2024-06-03 22:19:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365431888] [2024-06-03 22:19:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:34,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365431888] [2024-06-03 22:19:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365431888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:37,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:37,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:19:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045706807] [2024-06-03 22:19:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:37,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:19:37,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:37,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:19:37,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:19:37,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:19:37,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:37,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:37,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:19:37,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:37,353 INFO L124 PetriNetUnfolderBase]: 188/341 cut-off events. [2024-06-03 22:19:37,353 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-06-03 22:19:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 341 events. 188/341 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1198 event pairs, 46 based on Foata normal form. 3/344 useless extension candidates. Maximal degree in co-relation 1026. Up to 282 conditions per place. [2024-06-03 22:19:37,357 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 14 changer transitions 0/56 dead transitions. [2024-06-03 22:19:37,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 340 flow [2024-06-03 22:19:37,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:19:37,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:19:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2024-06-03 22:19:37,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-06-03 22:19:37,361 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 162 flow. Second operand 6 states and 96 transitions. [2024-06-03 22:19:37,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 340 flow [2024-06-03 22:19:37,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 336 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-03 22:19:37,366 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 214 flow [2024-06-03 22:19:37,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-03 22:19:37,367 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2024-06-03 22:19:37,368 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 214 flow [2024-06-03 22:19:37,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:37,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:37,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:37,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-03 22:19:37,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:37,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1260475274, now seen corresponding path program 1 times [2024-06-03 22:19:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:37,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614654820] [2024-06-03 22:19:37,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:40,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614654820] [2024-06-03 22:19:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614654820] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:40,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:40,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:19:40,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892335026] [2024-06-03 22:19:40,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:19:40,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:40,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:19:40,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:19:40,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:19:40,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:40,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:40,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:19:40,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:40,510 INFO L124 PetriNetUnfolderBase]: 189/344 cut-off events. [2024-06-03 22:19:40,510 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2024-06-03 22:19:40,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1179 conditions, 344 events. 189/344 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1218 event pairs, 24 based on Foata normal form. 6/350 useless extension candidates. Maximal degree in co-relation 1156. Up to 259 conditions per place. [2024-06-03 22:19:40,513 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 40 selfloop transitions, 16 changer transitions 0/58 dead transitions. [2024-06-03 22:19:40,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 386 flow [2024-06-03 22:19:40,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:19:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:19:40,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2024-06-03 22:19:40,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838709677419355 [2024-06-03 22:19:40,515 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 214 flow. Second operand 7 states and 105 transitions. [2024-06-03 22:19:40,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 386 flow [2024-06-03 22:19:40,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 354 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-03 22:19:40,518 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 217 flow [2024-06-03 22:19:40,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=217, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-03 22:19:40,521 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-03 22:19:40,522 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 217 flow [2024-06-03 22:19:40,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:40,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:40,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:40,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-03 22:19:40,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:40,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1934851801, now seen corresponding path program 1 times [2024-06-03 22:19:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103360626] [2024-06-03 22:19:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:45,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103360626] [2024-06-03 22:19:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103360626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:45,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 22:19:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723227003] [2024-06-03 22:19:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:45,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 22:19:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 22:19:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 22:19:45,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:19:45,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:45,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:45,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:19:45,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:45,968 INFO L124 PetriNetUnfolderBase]: 187/341 cut-off events. [2024-06-03 22:19:45,968 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2024-06-03 22:19:45,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 341 events. 187/341 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1194 event pairs, 47 based on Foata normal form. 1/342 useless extension candidates. Maximal degree in co-relation 1202. Up to 329 conditions per place. [2024-06-03 22:19:45,971 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 35 selfloop transitions, 6 changer transitions 0/43 dead transitions. [2024-06-03 22:19:45,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 311 flow [2024-06-03 22:19:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 22:19:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 22:19:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-06-03 22:19:45,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:19:45,972 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 217 flow. Second operand 5 states and 60 transitions. [2024-06-03 22:19:45,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 311 flow [2024-06-03 22:19:45,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 270 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:19:45,974 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 193 flow [2024-06-03 22:19:45,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-06-03 22:19:45,975 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-03 22:19:45,975 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 193 flow [2024-06-03 22:19:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:45,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:45,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:45,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-03 22:19:45,976 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:45,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:45,977 INFO L85 PathProgramCache]: Analyzing trace with hash 137115187, now seen corresponding path program 1 times [2024-06-03 22:19:45,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:45,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855865730] [2024-06-03 22:19:45,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855865730] [2024-06-03 22:19:50,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855865730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:50,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:50,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:19:50,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588064923] [2024-06-03 22:19:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:50,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:19:50,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:50,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:19:50,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:19:50,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:19:50,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:50,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:50,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:19:50,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:51,039 INFO L124 PetriNetUnfolderBase]: 181/332 cut-off events. [2024-06-03 22:19:51,040 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-06-03 22:19:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 332 events. 181/332 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1134 event pairs, 44 based on Foata normal form. 3/335 useless extension candidates. Maximal degree in co-relation 1128. Up to 311 conditions per place. [2024-06-03 22:19:51,043 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 38 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2024-06-03 22:19:51,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 311 flow [2024-06-03 22:19:51,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:19:51,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:19:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2024-06-03 22:19:51,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2024-06-03 22:19:51,044 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 193 flow. Second operand 6 states and 71 transitions. [2024-06-03 22:19:51,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 311 flow [2024-06-03 22:19:51,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 296 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-03 22:19:51,046 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 211 flow [2024-06-03 22:19:51,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=211, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-03 22:19:51,047 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 19 predicate places. [2024-06-03 22:19:51,047 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 211 flow [2024-06-03 22:19:51,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:51,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:51,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:51,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-03 22:19:51,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:51,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -514451052, now seen corresponding path program 1 times [2024-06-03 22:19:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:51,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490854420] [2024-06-03 22:19:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:19:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490854420] [2024-06-03 22:19:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490854420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:55,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:55,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:19:55,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907595845] [2024-06-03 22:19:55,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:55,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:19:55,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:19:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:19:55,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:19:55,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 211 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:55,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:55,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:19:55,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:55,827 INFO L124 PetriNetUnfolderBase]: 182/334 cut-off events. [2024-06-03 22:19:55,827 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES. [2024-06-03 22:19:55,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 334 events. 182/334 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1159 event pairs, 43 based on Foata normal form. 2/336 useless extension candidates. Maximal degree in co-relation 1200. Up to 288 conditions per place. [2024-06-03 22:19:55,829 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 13 changer transitions 0/52 dead transitions. [2024-06-03 22:19:55,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 362 flow [2024-06-03 22:19:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 22:19:55,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 22:19:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2024-06-03 22:19:55,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41397849462365593 [2024-06-03 22:19:55,833 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 211 flow. Second operand 6 states and 77 transitions. [2024-06-03 22:19:55,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 362 flow [2024-06-03 22:19:55,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 345 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-03 22:19:55,838 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 242 flow [2024-06-03 22:19:55,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-03 22:19:55,839 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2024-06-03 22:19:55,840 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 242 flow [2024-06-03 22:19:55,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:55,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:55,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:55,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-03 22:19:55,840 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:55,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:55,841 INFO L85 PathProgramCache]: Analyzing trace with hash 328281990, now seen corresponding path program 2 times [2024-06-03 22:19:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:55,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469735920] [2024-06-03 22:19:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:55,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:19:59,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-03 22:19:59,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:19:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469735920] [2024-06-03 22:19:59,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469735920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:19:59,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:19:59,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-03 22:19:59,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860877583] [2024-06-03 22:19:59,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:19:59,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-03 22:19:59,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:19:59,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-03 22:19:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-03 22:19:59,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:19:59,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 242 flow. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:59,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:19:59,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:19:59,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:19:59,851 INFO L124 PetriNetUnfolderBase]: 177/327 cut-off events. [2024-06-03 22:19:59,851 INFO L125 PetriNetUnfolderBase]: For 1252/1252 co-relation queries the response was YES. [2024-06-03 22:19:59,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 327 events. 177/327 cut-off events. For 1252/1252 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1125 event pairs, 88 based on Foata normal form. 1/328 useless extension candidates. Maximal degree in co-relation 1204. Up to 309 conditions per place. [2024-06-03 22:19:59,854 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 37 selfloop transitions, 10 changer transitions 0/49 dead transitions. [2024-06-03 22:19:59,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 49 transitions, 361 flow [2024-06-03 22:19:59,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:19:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:19:59,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 76 transitions. [2024-06-03 22:19:59,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35023041474654376 [2024-06-03 22:19:59,855 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 242 flow. Second operand 7 states and 76 transitions. [2024-06-03 22:19:59,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 49 transitions, 361 flow [2024-06-03 22:19:59,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 345 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-03 22:19:59,860 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 269 flow [2024-06-03 22:19:59,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=269, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2024-06-03 22:19:59,861 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-03 22:19:59,861 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 269 flow [2024-06-03 22:19:59,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:19:59,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:19:59,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:19:59,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-03 22:19:59,862 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:19:59,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:19:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1202049722, now seen corresponding path program 1 times [2024-06-03 22:19:59,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:19:59,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135693595] [2024-06-03 22:19:59,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:19:59,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:19:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135693595] [2024-06-03 22:20:05,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135693595] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:05,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:05,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:05,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327124709] [2024-06-03 22:20:05,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:05,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:05,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:05,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:05,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:05,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:05,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 269 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:05,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:05,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:05,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:05,894 INFO L124 PetriNetUnfolderBase]: 227/409 cut-off events. [2024-06-03 22:20:05,895 INFO L125 PetriNetUnfolderBase]: For 1889/1889 co-relation queries the response was YES. [2024-06-03 22:20:05,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 409 events. 227/409 cut-off events. For 1889/1889 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1510 event pairs, 44 based on Foata normal form. 6/415 useless extension candidates. Maximal degree in co-relation 1535. Up to 289 conditions per place. [2024-06-03 22:20:05,898 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 54 selfloop transitions, 23 changer transitions 0/79 dead transitions. [2024-06-03 22:20:05,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 602 flow [2024-06-03 22:20:05,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:05,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-03 22:20:05,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314516129032258 [2024-06-03 22:20:05,900 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 269 flow. Second operand 8 states and 107 transitions. [2024-06-03 22:20:05,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 602 flow [2024-06-03 22:20:05,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 79 transitions, 554 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:05,904 INFO L231 Difference]: Finished difference. Result has 62 places, 60 transitions, 410 flow [2024-06-03 22:20:05,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=410, PETRI_PLACES=62, PETRI_TRANSITIONS=60} [2024-06-03 22:20:05,905 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 32 predicate places. [2024-06-03 22:20:05,905 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 60 transitions, 410 flow [2024-06-03 22:20:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:05,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:05,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:05,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-03 22:20:05,906 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:05,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1553636556, now seen corresponding path program 2 times [2024-06-03 22:20:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598871568] [2024-06-03 22:20:05,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:10,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598871568] [2024-06-03 22:20:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598871568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:10,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:10,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:10,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078384317] [2024-06-03 22:20:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:10,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:10,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:10,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 60 transitions, 410 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:10,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:10,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:10,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:10,625 INFO L124 PetriNetUnfolderBase]: 265/471 cut-off events. [2024-06-03 22:20:10,626 INFO L125 PetriNetUnfolderBase]: For 2630/2630 co-relation queries the response was YES. [2024-06-03 22:20:10,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 471 events. 265/471 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1799 event pairs, 55 based on Foata normal form. 6/477 useless extension candidates. Maximal degree in co-relation 2026. Up to 305 conditions per place. [2024-06-03 22:20:10,629 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 48 selfloop transitions, 31 changer transitions 0/81 dead transitions. [2024-06-03 22:20:10,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 678 flow [2024-06-03 22:20:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:20:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:20:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 93 transitions. [2024-06-03 22:20:10,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-03 22:20:10,630 INFO L175 Difference]: Start difference. First operand has 62 places, 60 transitions, 410 flow. Second operand 7 states and 93 transitions. [2024-06-03 22:20:10,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 678 flow [2024-06-03 22:20:10,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 81 transitions, 666 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-03 22:20:10,634 INFO L231 Difference]: Finished difference. Result has 68 places, 66 transitions, 516 flow [2024-06-03 22:20:10,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=68, PETRI_TRANSITIONS=66} [2024-06-03 22:20:10,635 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 38 predicate places. [2024-06-03 22:20:10,635 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 66 transitions, 516 flow [2024-06-03 22:20:10,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:10,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:10,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:10,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-03 22:20:10,636 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:10,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1587045232, now seen corresponding path program 3 times [2024-06-03 22:20:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:10,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420378081] [2024-06-03 22:20:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:10,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:14,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:14,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:14,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420378081] [2024-06-03 22:20:14,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420378081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:14,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:14,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:14,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085884912] [2024-06-03 22:20:14,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:14,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:14,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:14,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:14,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 66 transitions, 516 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:14,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:14,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:14,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:15,018 INFO L124 PetriNetUnfolderBase]: 274/486 cut-off events. [2024-06-03 22:20:15,019 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2024-06-03 22:20:15,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 486 events. 274/486 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1852 event pairs, 104 based on Foata normal form. 3/489 useless extension candidates. Maximal degree in co-relation 2289. Up to 460 conditions per place. [2024-06-03 22:20:15,022 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 62 selfloop transitions, 12 changer transitions 0/76 dead transitions. [2024-06-03 22:20:15,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 76 transitions, 703 flow [2024-06-03 22:20:15,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:15,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:15,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:20:15,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-03 22:20:15,024 INFO L175 Difference]: Start difference. First operand has 68 places, 66 transitions, 516 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:20:15,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 76 transitions, 703 flow [2024-06-03 22:20:15,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 665 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-03 22:20:15,030 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 529 flow [2024-06-03 22:20:15,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=529, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2024-06-03 22:20:15,030 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2024-06-03 22:20:15,031 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 529 flow [2024-06-03 22:20:15,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:15,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:15,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:15,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-03 22:20:15,031 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:15,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1198929262, now seen corresponding path program 4 times [2024-06-03 22:20:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:15,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007464436] [2024-06-03 22:20:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:19,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:19,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007464436] [2024-06-03 22:20:19,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007464436] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:19,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:19,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:19,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131120049] [2024-06-03 22:20:19,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:19,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:19,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:19,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:19,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:19,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:19,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 529 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:19,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:19,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:19,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:19,472 INFO L124 PetriNetUnfolderBase]: 268/477 cut-off events. [2024-06-03 22:20:19,473 INFO L125 PetriNetUnfolderBase]: For 3011/3011 co-relation queries the response was YES. [2024-06-03 22:20:19,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2234 conditions, 477 events. 268/477 cut-off events. For 3011/3011 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1829 event pairs, 102 based on Foata normal form. 3/480 useless extension candidates. Maximal degree in co-relation 2195. Up to 439 conditions per place. [2024-06-03 22:20:19,476 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 64 selfloop transitions, 14 changer transitions 0/80 dead transitions. [2024-06-03 22:20:19,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 80 transitions, 733 flow [2024-06-03 22:20:19,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:20:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:20:19,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-03 22:20:19,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:20:19,478 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 529 flow. Second operand 7 states and 84 transitions. [2024-06-03 22:20:19,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 80 transitions, 733 flow [2024-06-03 22:20:19,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 80 transitions, 701 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:19,483 INFO L231 Difference]: Finished difference. Result has 74 places, 70 transitions, 554 flow [2024-06-03 22:20:19,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=67, 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=7, PETRI_FLOW=554, PETRI_PLACES=74, PETRI_TRANSITIONS=70} [2024-06-03 22:20:19,484 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2024-06-03 22:20:19,484 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 70 transitions, 554 flow [2024-06-03 22:20:19,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:19,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:19,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:19,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-03 22:20:19,485 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:19,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash -268215941, now seen corresponding path program 1 times [2024-06-03 22:20:19,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942891085] [2024-06-03 22:20:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:25,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942891085] [2024-06-03 22:20:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942891085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:25,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:25,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:25,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326838055] [2024-06-03 22:20:25,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:25,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:25,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:25,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:25,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:25,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:25,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 70 transitions, 554 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:25,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:25,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:25,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:26,011 INFO L124 PetriNetUnfolderBase]: 283/503 cut-off events. [2024-06-03 22:20:26,011 INFO L125 PetriNetUnfolderBase]: For 3362/3362 co-relation queries the response was YES. [2024-06-03 22:20:26,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2383 conditions, 503 events. 283/503 cut-off events. For 3362/3362 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1976 event pairs, 60 based on Foata normal form. 1/504 useless extension candidates. Maximal degree in co-relation 2344. Up to 425 conditions per place. [2024-06-03 22:20:26,015 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 66 selfloop transitions, 23 changer transitions 0/91 dead transitions. [2024-06-03 22:20:26,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 838 flow [2024-06-03 22:20:26,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 22:20:26,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-03 22:20:26,016 INFO L175 Difference]: Start difference. First operand has 74 places, 70 transitions, 554 flow. Second operand 8 states and 99 transitions. [2024-06-03 22:20:26,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 838 flow [2024-06-03 22:20:26,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 801 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:20:26,021 INFO L231 Difference]: Finished difference. Result has 78 places, 78 transitions, 628 flow [2024-06-03 22:20:26,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=628, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2024-06-03 22:20:26,022 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 48 predicate places. [2024-06-03 22:20:26,023 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 628 flow [2024-06-03 22:20:26,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:26,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:26,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:26,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-03 22:20:26,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:26,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:26,024 INFO L85 PathProgramCache]: Analyzing trace with hash 322704401, now seen corresponding path program 2 times [2024-06-03 22:20:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:26,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596009656] [2024-06-03 22:20:26,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:26,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:30,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:30,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596009656] [2024-06-03 22:20:30,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596009656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:30,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240549506] [2024-06-03 22:20:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:30,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:30,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:30,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 628 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:30,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:30,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:30,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:30,817 INFO L124 PetriNetUnfolderBase]: 281/500 cut-off events. [2024-06-03 22:20:30,817 INFO L125 PetriNetUnfolderBase]: For 3756/3756 co-relation queries the response was YES. [2024-06-03 22:20:30,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 500 events. 281/500 cut-off events. For 3756/3756 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1942 event pairs, 54 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 2410. Up to 434 conditions per place. [2024-06-03 22:20:30,820 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 21 changer transitions 0/89 dead transitions. [2024-06-03 22:20:30,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 89 transitions, 835 flow [2024-06-03 22:20:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:30,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:20:30,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-03 22:20:30,822 INFO L175 Difference]: Start difference. First operand has 78 places, 78 transitions, 628 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:20:30,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 89 transitions, 835 flow [2024-06-03 22:20:30,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 89 transitions, 816 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-03 22:20:30,828 INFO L231 Difference]: Finished difference. Result has 84 places, 78 transitions, 656 flow [2024-06-03 22:20:30,828 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=656, PETRI_PLACES=84, PETRI_TRANSITIONS=78} [2024-06-03 22:20:30,828 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 54 predicate places. [2024-06-03 22:20:30,828 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 78 transitions, 656 flow [2024-06-03 22:20:30,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:30,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:30,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:30,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-03 22:20:30,829 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:30,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1729931091, now seen corresponding path program 3 times [2024-06-03 22:20:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:30,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685825051] [2024-06-03 22:20:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:35,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:35,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685825051] [2024-06-03 22:20:35,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685825051] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:35,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002361932] [2024-06-03 22:20:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:35,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:35,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:36,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:36,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 78 transitions, 656 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:36,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:36,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:36,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:36,391 INFO L124 PetriNetUnfolderBase]: 288/512 cut-off events. [2024-06-03 22:20:36,391 INFO L125 PetriNetUnfolderBase]: For 4386/4386 co-relation queries the response was YES. [2024-06-03 22:20:36,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2581 conditions, 512 events. 288/512 cut-off events. For 4386/4386 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1997 event pairs, 58 based on Foata normal form. 1/513 useless extension candidates. Maximal degree in co-relation 2538. Up to 412 conditions per place. [2024-06-03 22:20:36,395 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 66 selfloop transitions, 30 changer transitions 0/98 dead transitions. [2024-06-03 22:20:36,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 98 transitions, 962 flow [2024-06-03 22:20:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-03 22:20:36,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919354838709675 [2024-06-03 22:20:36,398 INFO L175 Difference]: Start difference. First operand has 84 places, 78 transitions, 656 flow. Second operand 8 states and 99 transitions. [2024-06-03 22:20:36,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 98 transitions, 962 flow [2024-06-03 22:20:36,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 98 transitions, 920 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-03 22:20:36,405 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 757 flow [2024-06-03 22:20:36,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2024-06-03 22:20:36,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 58 predicate places. [2024-06-03 22:20:36,406 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 757 flow [2024-06-03 22:20:36,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:36,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:36,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:36,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-03 22:20:36,406 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:36,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1391159500, now seen corresponding path program 1 times [2024-06-03 22:20:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454639092] [2024-06-03 22:20:36,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:42,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:42,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454639092] [2024-06-03 22:20:42,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454639092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:42,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:42,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:42,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302408026] [2024-06-03 22:20:42,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:42,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:42,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:42,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:42,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:42,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:42,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 757 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:42,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:42,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:42,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:42,601 INFO L124 PetriNetUnfolderBase]: 301/534 cut-off events. [2024-06-03 22:20:42,602 INFO L125 PetriNetUnfolderBase]: For 5370/5370 co-relation queries the response was YES. [2024-06-03 22:20:42,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2825 conditions, 534 events. 301/534 cut-off events. For 5370/5370 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2146 event pairs, 55 based on Foata normal form. 3/537 useless extension candidates. Maximal degree in co-relation 2779. Up to 397 conditions per place. [2024-06-03 22:20:42,606 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 27 changer transitions 0/112 dead transitions. [2024-06-03 22:20:42,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 1166 flow [2024-06-03 22:20:42,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:20:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:20:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 110 transitions. [2024-06-03 22:20:42,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-06-03 22:20:42,607 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 757 flow. Second operand 8 states and 110 transitions. [2024-06-03 22:20:42,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 1166 flow [2024-06-03 22:20:42,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 112 transitions, 1120 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-03 22:20:42,616 INFO L231 Difference]: Finished difference. Result has 95 places, 90 transitions, 847 flow [2024-06-03 22:20:42,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=847, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2024-06-03 22:20:42,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 65 predicate places. [2024-06-03 22:20:42,616 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 847 flow [2024-06-03 22:20:42,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:42,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:42,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:42,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-03 22:20:42,617 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:42,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 803419758, now seen corresponding path program 2 times [2024-06-03 22:20:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:42,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814997856] [2024-06-03 22:20:42,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:42,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:48,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814997856] [2024-06-03 22:20:48,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814997856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:48,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:48,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:20:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303900162] [2024-06-03 22:20:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:48,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:20:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:20:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:20:49,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:49,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 847 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:49,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:49,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:49,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:49,417 INFO L124 PetriNetUnfolderBase]: 295/525 cut-off events. [2024-06-03 22:20:49,417 INFO L125 PetriNetUnfolderBase]: For 5576/5576 co-relation queries the response was YES. [2024-06-03 22:20:49,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 525 events. 295/525 cut-off events. For 5576/5576 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2089 event pairs, 53 based on Foata normal form. 3/528 useless extension candidates. Maximal degree in co-relation 2826. Up to 393 conditions per place. [2024-06-03 22:20:49,421 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 81 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2024-06-03 22:20:49,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 1166 flow [2024-06-03 22:20:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:20:49,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:20:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:20:49,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:20:49,422 INFO L175 Difference]: Start difference. First operand has 95 places, 90 transitions, 847 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:20:49,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 1166 flow [2024-06-03 22:20:49,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 1114 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-03 22:20:49,434 INFO L231 Difference]: Finished difference. Result has 99 places, 90 transitions, 856 flow [2024-06-03 22:20:49,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=856, PETRI_PLACES=99, PETRI_TRANSITIONS=90} [2024-06-03 22:20:49,434 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-03 22:20:49,434 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 90 transitions, 856 flow [2024-06-03 22:20:49,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:49,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:49,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:49,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-03 22:20:49,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:49,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:49,435 INFO L85 PathProgramCache]: Analyzing trace with hash -921907197, now seen corresponding path program 4 times [2024-06-03 22:20:49,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:49,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042947293] [2024-06-03 22:20:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:49,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:20:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:20:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:20:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042947293] [2024-06-03 22:20:54,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042947293] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:20:54,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:20:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:20:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232114843] [2024-06-03 22:20:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:20:54,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:20:54,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:20:54,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:20:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:20:54,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:20:54,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 90 transitions, 856 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:54,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:20:54,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:20:54,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:20:54,753 INFO L124 PetriNetUnfolderBase]: 298/530 cut-off events. [2024-06-03 22:20:54,753 INFO L125 PetriNetUnfolderBase]: For 5949/5949 co-relation queries the response was YES. [2024-06-03 22:20:54,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 530 events. 298/530 cut-off events. For 5949/5949 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2116 event pairs, 59 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 2893. Up to 422 conditions per place. [2024-06-03 22:20:54,757 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 67 selfloop transitions, 34 changer transitions 0/103 dead transitions. [2024-06-03 22:20:54,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 103 transitions, 1140 flow [2024-06-03 22:20:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:20:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:20:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 89 transitions. [2024-06-03 22:20:54,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41013824884792627 [2024-06-03 22:20:54,759 INFO L175 Difference]: Start difference. First operand has 99 places, 90 transitions, 856 flow. Second operand 7 states and 89 transitions. [2024-06-03 22:20:54,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 103 transitions, 1140 flow [2024-06-03 22:20:54,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 103 transitions, 1085 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:20:54,770 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 900 flow [2024-06-03 22:20:54,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=900, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2024-06-03 22:20:54,770 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 69 predicate places. [2024-06-03 22:20:54,771 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 900 flow [2024-06-03 22:20:54,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:20:54,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:20:54,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:20:54,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-03 22:20:54,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:20:54,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:20:54,772 INFO L85 PathProgramCache]: Analyzing trace with hash -921816987, now seen corresponding path program 5 times [2024-06-03 22:20:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:20:54,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206203079] [2024-06-03 22:20:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:20:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:20:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206203079] [2024-06-03 22:21:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206203079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:21:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221384489] [2024-06-03 22:21:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:21:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:21:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:21:01,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:01,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 900 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:01,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:01,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:01,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:01,531 INFO L124 PetriNetUnfolderBase]: 296/527 cut-off events. [2024-06-03 22:21:01,531 INFO L125 PetriNetUnfolderBase]: For 6282/6282 co-relation queries the response was YES. [2024-06-03 22:21:01,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2950 conditions, 527 events. 296/527 cut-off events. For 6282/6282 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2095 event pairs, 104 based on Foata normal form. 1/528 useless extension candidates. Maximal degree in co-relation 2898. Up to 485 conditions per place. [2024-06-03 22:21:01,536 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 82 selfloop transitions, 17 changer transitions 0/101 dead transitions. [2024-06-03 22:21:01,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 101 transitions, 1143 flow [2024-06-03 22:21:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:21:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:21:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-03 22:21:01,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3629032258064516 [2024-06-03 22:21:01,537 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 900 flow. Second operand 8 states and 90 transitions. [2024-06-03 22:21:01,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 101 transitions, 1143 flow [2024-06-03 22:21:01,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 101 transitions, 1082 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:21:01,548 INFO L231 Difference]: Finished difference. Result has 102 places, 93 transitions, 906 flow [2024-06-03 22:21:01,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=906, PETRI_PLACES=102, PETRI_TRANSITIONS=93} [2024-06-03 22:21:01,548 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-03 22:21:01,549 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 93 transitions, 906 flow [2024-06-03 22:21:01,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:01,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:01,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:01,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-03 22:21:01,550 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:01,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash -918092182, now seen corresponding path program 3 times [2024-06-03 22:21:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:01,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335128471] [2024-06-03 22:21:01,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:05,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335128471] [2024-06-03 22:21:05,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335128471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:05,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:05,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:05,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811572492] [2024-06-03 22:21:05,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:05,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:05,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:05,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 93 transitions, 906 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:05,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:05,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:05,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:06,044 INFO L124 PetriNetUnfolderBase]: 305/542 cut-off events. [2024-06-03 22:21:06,045 INFO L125 PetriNetUnfolderBase]: For 5974/5974 co-relation queries the response was YES. [2024-06-03 22:21:06,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2960 conditions, 542 events. 305/542 cut-off events. For 5974/5974 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2187 event pairs, 101 based on Foata normal form. 3/545 useless extension candidates. Maximal degree in co-relation 2908. Up to 425 conditions per place. [2024-06-03 22:21:06,049 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-03 22:21:06,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 111 transitions, 1234 flow [2024-06-03 22:21:06,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-03 22:21:06,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3906810035842294 [2024-06-03 22:21:06,050 INFO L175 Difference]: Start difference. First operand has 102 places, 93 transitions, 906 flow. Second operand 9 states and 109 transitions. [2024-06-03 22:21:06,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 111 transitions, 1234 flow [2024-06-03 22:21:06,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 111 transitions, 1153 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:06,061 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 912 flow [2024-06-03 22:21:06,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-06-03 22:21:06,062 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 73 predicate places. [2024-06-03 22:21:06,062 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 912 flow [2024-06-03 22:21:06,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:06,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:06,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:06,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-03 22:21:06,062 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:06,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1687205114, now seen corresponding path program 4 times [2024-06-03 22:21:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519340301] [2024-06-03 22:21:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:10,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:10,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519340301] [2024-06-03 22:21:10,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519340301] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:10,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:10,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 22:21:10,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100394270] [2024-06-03 22:21:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:10,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 22:21:10,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:10,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 22:21:10,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-03 22:21:10,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:10,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 912 flow. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:10,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:10,570 INFO L124 PetriNetUnfolderBase]: 314/559 cut-off events. [2024-06-03 22:21:10,570 INFO L125 PetriNetUnfolderBase]: For 6554/6554 co-relation queries the response was YES. [2024-06-03 22:21:10,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 559 events. 314/559 cut-off events. For 6554/6554 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2291 event pairs, 73 based on Foata normal form. 3/562 useless extension candidates. Maximal degree in co-relation 2982. Up to 365 conditions per place. [2024-06-03 22:21:10,575 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 70 selfloop transitions, 47 changer transitions 0/119 dead transitions. [2024-06-03 22:21:10,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 119 transitions, 1287 flow [2024-06-03 22:21:10,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-03 22:21:10,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-03 22:21:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 98 transitions. [2024-06-03 22:21:10,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 22:21:10,576 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 912 flow. Second operand 7 states and 98 transitions. [2024-06-03 22:21:10,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 119 transitions, 1287 flow [2024-06-03 22:21:10,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 119 transitions, 1196 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:10,587 INFO L231 Difference]: Finished difference. Result has 102 places, 99 transitions, 959 flow [2024-06-03 22:21:10,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=959, PETRI_PLACES=102, PETRI_TRANSITIONS=99} [2024-06-03 22:21:10,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 72 predicate places. [2024-06-03 22:21:10,587 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 959 flow [2024-06-03 22:21:10,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:10,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:10,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:10,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-03 22:21:10,588 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:10,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:10,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1953762734, now seen corresponding path program 5 times [2024-06-03 22:21:10,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:10,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452390576] [2024-06-03 22:21:10,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:10,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452390576] [2024-06-03 22:21:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452390576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:14,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:14,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934275854] [2024-06-03 22:21:14,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:14,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:14,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:14,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:14,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 99 transitions, 959 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:14,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:14,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:14,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:14,857 INFO L124 PetriNetUnfolderBase]: 323/573 cut-off events. [2024-06-03 22:21:14,857 INFO L125 PetriNetUnfolderBase]: For 7174/7174 co-relation queries the response was YES. [2024-06-03 22:21:14,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3171 conditions, 573 events. 323/573 cut-off events. For 7174/7174 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2347 event pairs, 107 based on Foata normal form. 3/576 useless extension candidates. Maximal degree in co-relation 3120. Up to 532 conditions per place. [2024-06-03 22:21:14,875 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 96 selfloop transitions, 15 changer transitions 0/113 dead transitions. [2024-06-03 22:21:14,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 113 transitions, 1246 flow [2024-06-03 22:21:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:21:14,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-03 22:21:14,877 INFO L175 Difference]: Start difference. First operand has 102 places, 99 transitions, 959 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:21:14,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 113 transitions, 1246 flow [2024-06-03 22:21:14,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 113 transitions, 1167 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:14,887 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 957 flow [2024-06-03 22:21:14,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=957, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-06-03 22:21:14,887 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 76 predicate places. [2024-06-03 22:21:14,888 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 957 flow [2024-06-03 22:21:14,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:14,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:14,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:14,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-03 22:21:14,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:14,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 278017642, now seen corresponding path program 6 times [2024-06-03 22:21:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022059650] [2024-06-03 22:21:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:19,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:19,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:19,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022059650] [2024-06-03 22:21:19,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022059650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:19,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:19,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:19,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633542148] [2024-06-03 22:21:19,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:19,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:19,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:19,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:19,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 957 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:19,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:19,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:19,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:19,552 INFO L124 PetriNetUnfolderBase]: 317/563 cut-off events. [2024-06-03 22:21:19,552 INFO L125 PetriNetUnfolderBase]: For 6482/6482 co-relation queries the response was YES. [2024-06-03 22:21:19,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 563 events. 317/563 cut-off events. For 6482/6482 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2301 event pairs, 101 based on Foata normal form. 3/566 useless extension candidates. Maximal degree in co-relation 2943. Up to 511 conditions per place. [2024-06-03 22:21:19,557 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 95 selfloop transitions, 18 changer transitions 0/115 dead transitions. [2024-06-03 22:21:19,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 115 transitions, 1220 flow [2024-06-03 22:21:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 22:21:19,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-03 22:21:19,558 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 957 flow. Second operand 9 states and 102 transitions. [2024-06-03 22:21:19,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 115 transitions, 1220 flow [2024-06-03 22:21:19,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 115 transitions, 1178 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:19,569 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 957 flow [2024-06-03 22:21:19,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=957, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2024-06-03 22:21:19,570 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-03 22:21:19,570 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 957 flow [2024-06-03 22:21:19,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:19,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:19,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:19,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-03 22:21:19,571 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:19,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 278227109, now seen corresponding path program 1 times [2024-06-03 22:21:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:19,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138742323] [2024-06-03 22:21:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:19,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:23,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:23,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138742323] [2024-06-03 22:21:23,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138742323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:23,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:23,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:23,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727300599] [2024-06-03 22:21:23,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:23,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:23,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:23,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 957 flow. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:23,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:23,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:23,999 INFO L124 PetriNetUnfolderBase]: 313/557 cut-off events. [2024-06-03 22:21:23,999 INFO L125 PetriNetUnfolderBase]: For 6480/6480 co-relation queries the response was YES. [2024-06-03 22:21:24,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2964 conditions, 557 events. 313/557 cut-off events. For 6480/6480 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2266 event pairs, 101 based on Foata normal form. 2/559 useless extension candidates. Maximal degree in co-relation 2912. Up to 525 conditions per place. [2024-06-03 22:21:24,003 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 98 selfloop transitions, 13 changer transitions 0/113 dead transitions. [2024-06-03 22:21:24,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 1217 flow [2024-06-03 22:21:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:21:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:21:24,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 89 transitions. [2024-06-03 22:21:24,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588709677419355 [2024-06-03 22:21:24,005 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 957 flow. Second operand 8 states and 89 transitions. [2024-06-03 22:21:24,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 1217 flow [2024-06-03 22:21:24,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 113 transitions, 1146 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:21:24,015 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 939 flow [2024-06-03 22:21:24,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=939, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-06-03 22:21:24,015 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 78 predicate places. [2024-06-03 22:21:24,016 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 939 flow [2024-06-03 22:21:24,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:24,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:24,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:24,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-03 22:21:24,016 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:24,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:24,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1480269047, now seen corresponding path program 1 times [2024-06-03 22:21:24,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:24,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224985098] [2024-06-03 22:21:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:29,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:29,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:29,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224985098] [2024-06-03 22:21:29,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224985098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:29,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:29,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:21:29,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543313219] [2024-06-03 22:21:29,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:29,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:21:29,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:29,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:21:29,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:21:29,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:29,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 939 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:29,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:29,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:29,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:30,334 INFO L124 PetriNetUnfolderBase]: 310/552 cut-off events. [2024-06-03 22:21:30,335 INFO L125 PetriNetUnfolderBase]: For 6401/6401 co-relation queries the response was YES. [2024-06-03 22:21:30,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 552 events. 310/552 cut-off events. For 6401/6401 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2228 event pairs, 100 based on Foata normal form. 2/554 useless extension candidates. Maximal degree in co-relation 2842. Up to 522 conditions per place. [2024-06-03 22:21:30,338 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 99 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2024-06-03 22:21:30,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 1181 flow [2024-06-03 22:21:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:21:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:21:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2024-06-03 22:21:30,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35080645161290325 [2024-06-03 22:21:30,340 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 939 flow. Second operand 8 states and 87 transitions. [2024-06-03 22:21:30,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 1181 flow [2024-06-03 22:21:30,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 1141 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 22:21:30,351 INFO L231 Difference]: Finished difference. Result has 110 places, 104 transitions, 927 flow [2024-06-03 22:21:30,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=927, PETRI_PLACES=110, PETRI_TRANSITIONS=104} [2024-06-03 22:21:30,351 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 80 predicate places. [2024-06-03 22:21:30,351 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 104 transitions, 927 flow [2024-06-03 22:21:30,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:30,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:30,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:30,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-03 22:21:30,352 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:30,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:30,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1410209669, now seen corresponding path program 1 times [2024-06-03 22:21:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:30,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672577468] [2024-06-03 22:21:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:30,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:36,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:36,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672577468] [2024-06-03 22:21:36,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672577468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:36,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:36,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:36,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522169422] [2024-06-03 22:21:36,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:36,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:36,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:36,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:36,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:36,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 104 transitions, 927 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:36,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:36,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:36,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:37,190 INFO L124 PetriNetUnfolderBase]: 330/594 cut-off events. [2024-06-03 22:21:37,191 INFO L125 PetriNetUnfolderBase]: For 7568/7568 co-relation queries the response was YES. [2024-06-03 22:21:37,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3075 conditions, 594 events. 330/594 cut-off events. For 7568/7568 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2542 event pairs, 64 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 3021. Up to 473 conditions per place. [2024-06-03 22:21:37,194 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 94 selfloop transitions, 28 changer transitions 0/124 dead transitions. [2024-06-03 22:21:37,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 124 transitions, 1285 flow [2024-06-03 22:21:37,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:37,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:37,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-03 22:21:37,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3942652329749104 [2024-06-03 22:21:37,196 INFO L175 Difference]: Start difference. First operand has 110 places, 104 transitions, 927 flow. Second operand 9 states and 110 transitions. [2024-06-03 22:21:37,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 124 transitions, 1285 flow [2024-06-03 22:21:37,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 124 transitions, 1252 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:37,209 INFO L231 Difference]: Finished difference. Result has 113 places, 108 transitions, 994 flow [2024-06-03 22:21:37,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=994, PETRI_PLACES=113, PETRI_TRANSITIONS=108} [2024-06-03 22:21:37,210 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 83 predicate places. [2024-06-03 22:21:37,210 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 108 transitions, 994 flow [2024-06-03 22:21:37,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:37,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:37,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:37,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-03 22:21:37,210 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:37,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:37,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420903, now seen corresponding path program 1 times [2024-06-03 22:21:37,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:37,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789595478] [2024-06-03 22:21:37,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:37,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:43,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:43,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789595478] [2024-06-03 22:21:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789595478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:43,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514305774] [2024-06-03 22:21:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:43,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:43,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:43,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:43,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 108 transitions, 994 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:43,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:43,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:43,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:43,653 INFO L124 PetriNetUnfolderBase]: 348/623 cut-off events. [2024-06-03 22:21:43,653 INFO L125 PetriNetUnfolderBase]: For 8831/8831 co-relation queries the response was YES. [2024-06-03 22:21:43,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3334 conditions, 623 events. 348/623 cut-off events. For 8831/8831 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2696 event pairs, 69 based on Foata normal form. 1/624 useless extension candidates. Maximal degree in co-relation 3279. Up to 436 conditions per place. [2024-06-03 22:21:43,657 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 94 selfloop transitions, 36 changer transitions 0/132 dead transitions. [2024-06-03 22:21:43,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 132 transitions, 1394 flow [2024-06-03 22:21:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 22:21:43,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-03 22:21:43,659 INFO L175 Difference]: Start difference. First operand has 113 places, 108 transitions, 994 flow. Second operand 9 states and 116 transitions. [2024-06-03 22:21:43,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 132 transitions, 1394 flow [2024-06-03 22:21:43,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 132 transitions, 1350 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:43,676 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 1079 flow [2024-06-03 22:21:43,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1079, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2024-06-03 22:21:43,677 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 88 predicate places. [2024-06-03 22:21:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 1079 flow [2024-06-03 22:21:43,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:43,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:43,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:43,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-03 22:21:43,678 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:43,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:43,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1038420779, now seen corresponding path program 2 times [2024-06-03 22:21:43,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:43,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194614735] [2024-06-03 22:21:43,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:43,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:49,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:49,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:49,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194614735] [2024-06-03 22:21:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194614735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:49,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062339743] [2024-06-03 22:21:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:49,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:49,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:49,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:49,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 1079 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:49,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:49,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:49,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:50,251 INFO L124 PetriNetUnfolderBase]: 352/631 cut-off events. [2024-06-03 22:21:50,251 INFO L125 PetriNetUnfolderBase]: For 10087/10087 co-relation queries the response was YES. [2024-06-03 22:21:50,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3555 conditions, 631 events. 352/631 cut-off events. For 10087/10087 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2750 event pairs, 71 based on Foata normal form. 2/633 useless extension candidates. Maximal degree in co-relation 3497. Up to 539 conditions per place. [2024-06-03 22:21:50,255 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 99 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-06-03 22:21:50,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 127 transitions, 1372 flow [2024-06-03 22:21:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:50,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:21:50,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 22:21:50,257 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 1079 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:21:50,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 127 transitions, 1372 flow [2024-06-03 22:21:50,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 127 transitions, 1323 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-03 22:21:50,273 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 1097 flow [2024-06-03 22:21:50,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1097, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-06-03 22:21:50,275 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 92 predicate places. [2024-06-03 22:21:50,276 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 1097 flow [2024-06-03 22:21:50,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:50,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:50,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:50,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-03 22:21:50,276 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:50,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1413907473, now seen corresponding path program 2 times [2024-06-03 22:21:50,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:50,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624152443] [2024-06-03 22:21:50,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:50,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:50,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:21:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:21:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:21:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624152443] [2024-06-03 22:21:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624152443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:21:56,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:21:56,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:21:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111922852] [2024-06-03 22:21:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:21:56,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:21:56,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:21:56,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:21:56,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:21:56,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:21:56,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 1097 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:56,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:21:56,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:21:56,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:21:56,832 INFO L124 PetriNetUnfolderBase]: 361/646 cut-off events. [2024-06-03 22:21:56,833 INFO L125 PetriNetUnfolderBase]: For 11119/11119 co-relation queries the response was YES. [2024-06-03 22:21:56,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3696 conditions, 646 events. 361/646 cut-off events. For 11119/11119 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2862 event pairs, 58 based on Foata normal form. 3/649 useless extension candidates. Maximal degree in co-relation 3636. Up to 499 conditions per place. [2024-06-03 22:21:56,837 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 99 selfloop transitions, 35 changer transitions 0/136 dead transitions. [2024-06-03 22:21:56,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 136 transitions, 1460 flow [2024-06-03 22:21:56,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:21:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:21:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 22:21:56,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-03 22:21:56,838 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 1097 flow. Second operand 9 states and 116 transitions. [2024-06-03 22:21:56,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 136 transitions, 1460 flow [2024-06-03 22:21:56,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 1406 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:21:56,857 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 1148 flow [2024-06-03 22:21:56,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1043, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-06-03 22:21:56,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 94 predicate places. [2024-06-03 22:21:56,865 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 1148 flow [2024-06-03 22:21:56,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:21:56,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:21:56,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:21:56,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-03 22:21:56,866 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:21:56,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:21:56,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1401390603, now seen corresponding path program 3 times [2024-06-03 22:21:56,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:21:56,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358716125] [2024-06-03 22:21:56,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:21:56,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:21:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:01,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-03 22:22:01,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:01,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358716125] [2024-06-03 22:22:01,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358716125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:01,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:01,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090016106] [2024-06-03 22:22:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:01,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:01,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:01,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:01,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:01,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 1148 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:01,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:01,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:01,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:01,591 INFO L124 PetriNetUnfolderBase]: 364/651 cut-off events. [2024-06-03 22:22:01,591 INFO L125 PetriNetUnfolderBase]: For 11389/11389 co-relation queries the response was YES. [2024-06-03 22:22:01,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 651 events. 364/651 cut-off events. For 11389/11389 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2856 event pairs, 70 based on Foata normal form. 1/652 useless extension candidates. Maximal degree in co-relation 3756. Up to 438 conditions per place. [2024-06-03 22:22:01,602 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 85 selfloop transitions, 49 changer transitions 0/136 dead transitions. [2024-06-03 22:22:01,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 136 transitions, 1490 flow [2024-06-03 22:22:01,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:22:01,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-03 22:22:01,603 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 1148 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:22:01,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 136 transitions, 1490 flow [2024-06-03 22:22:01,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 136 transitions, 1416 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:01,622 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 1199 flow [2024-06-03 22:22:01,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1199, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2024-06-03 22:22:01,623 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 96 predicate places. [2024-06-03 22:22:01,623 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 1199 flow [2024-06-03 22:22:01,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:01,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:01,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:01,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-03 22:22:01,623 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:01,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1041217289, now seen corresponding path program 3 times [2024-06-03 22:22:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961527035] [2024-06-03 22:22:01,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:01,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:07,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-03 22:22:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961527035] [2024-06-03 22:22:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961527035] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183460468] [2024-06-03 22:22:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:07,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:07,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:07,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 1199 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:07,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:07,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:07,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:08,115 INFO L124 PetriNetUnfolderBase]: 361/646 cut-off events. [2024-06-03 22:22:08,115 INFO L125 PetriNetUnfolderBase]: For 11826/11826 co-relation queries the response was YES. [2024-06-03 22:22:08,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 646 events. 361/646 cut-off events. For 11826/11826 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2826 event pairs, 70 based on Foata normal form. 2/648 useless extension candidates. Maximal degree in co-relation 3740. Up to 568 conditions per place. [2024-06-03 22:22:08,122 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 25 changer transitions 0/131 dead transitions. [2024-06-03 22:22:08,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 1487 flow [2024-06-03 22:22:08,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:22:08,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-03 22:22:08,130 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 1199 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:22:08,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 1487 flow [2024-06-03 22:22:08,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 131 transitions, 1382 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:08,151 INFO L231 Difference]: Finished difference. Result has 128 places, 119 transitions, 1148 flow [2024-06-03 22:22:08,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=128, PETRI_TRANSITIONS=119} [2024-06-03 22:22:08,152 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 98 predicate places. [2024-06-03 22:22:08,152 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 119 transitions, 1148 flow [2024-06-03 22:22:08,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:08,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:08,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:08,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-03 22:22:08,153 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:08,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -952215625, now seen corresponding path program 4 times [2024-06-03 22:22:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172582735] [2024-06-03 22:22:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:13,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172582735] [2024-06-03 22:22:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172582735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:13,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772602083] [2024-06-03 22:22:13,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:13,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:13,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:13,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:13,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:13,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:13,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 119 transitions, 1148 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:13,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:13,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:13,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:14,218 INFO L124 PetriNetUnfolderBase]: 370/665 cut-off events. [2024-06-03 22:22:14,219 INFO L125 PetriNetUnfolderBase]: For 12364/12364 co-relation queries the response was YES. [2024-06-03 22:22:14,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3817 conditions, 665 events. 370/665 cut-off events. For 12364/12364 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2955 event pairs, 51 based on Foata normal form. 2/667 useless extension candidates. Maximal degree in co-relation 3754. Up to 461 conditions per place. [2024-06-03 22:22:14,223 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 95 selfloop transitions, 41 changer transitions 0/138 dead transitions. [2024-06-03 22:22:14,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 1536 flow [2024-06-03 22:22:14,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:22:14,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 22:22:14,225 INFO L175 Difference]: Start difference. First operand has 128 places, 119 transitions, 1148 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:22:14,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 1536 flow [2024-06-03 22:22:14,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 138 transitions, 1484 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:14,245 INFO L231 Difference]: Finished difference. Result has 131 places, 121 transitions, 1204 flow [2024-06-03 22:22:14,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1096, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1204, PETRI_PLACES=131, PETRI_TRANSITIONS=121} [2024-06-03 22:22:14,246 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 101 predicate places. [2024-06-03 22:22:14,253 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 121 transitions, 1204 flow [2024-06-03 22:22:14,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:14,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:14,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:14,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-03 22:22:14,254 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:14,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1035938771, now seen corresponding path program 5 times [2024-06-03 22:22:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:14,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410380057] [2024-06-03 22:22:14,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:14,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:20,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:20,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410380057] [2024-06-03 22:22:20,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410380057] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:20,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:20,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:20,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513051100] [2024-06-03 22:22:20,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:20,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:20,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:20,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:20,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:20,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:20,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 121 transitions, 1204 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:20,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:20,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:21,088 INFO L124 PetriNetUnfolderBase]: 386/697 cut-off events. [2024-06-03 22:22:21,088 INFO L125 PetriNetUnfolderBase]: For 14270/14270 co-relation queries the response was YES. [2024-06-03 22:22:21,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 697 events. 386/697 cut-off events. For 14270/14270 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3184 event pairs, 74 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4041. Up to 561 conditions per place. [2024-06-03 22:22:21,123 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 103 selfloop transitions, 36 changer transitions 0/141 dead transitions. [2024-06-03 22:22:21,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 1620 flow [2024-06-03 22:22:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:21,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 22:22:21,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 22:22:21,124 INFO L175 Difference]: Start difference. First operand has 131 places, 121 transitions, 1204 flow. Second operand 9 states and 111 transitions. [2024-06-03 22:22:21,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 1620 flow [2024-06-03 22:22:21,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 141 transitions, 1503 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:21,149 INFO L231 Difference]: Finished difference. Result has 134 places, 124 transitions, 1207 flow [2024-06-03 22:22:21,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1097, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1207, PETRI_PLACES=134, PETRI_TRANSITIONS=124} [2024-06-03 22:22:21,150 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2024-06-03 22:22:21,150 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 124 transitions, 1207 flow [2024-06-03 22:22:21,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:21,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:21,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:21,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-03 22:22:21,150 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:21,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2088271203, now seen corresponding path program 4 times [2024-06-03 22:22:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348769472] [2024-06-03 22:22:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:27,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348769472] [2024-06-03 22:22:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348769472] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:27,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477251982] [2024-06-03 22:22:27,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:27,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:27,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:27,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:27,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:27,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 124 transitions, 1207 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:27,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:27,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:27,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:27,775 INFO L124 PetriNetUnfolderBase]: 389/702 cut-off events. [2024-06-03 22:22:27,775 INFO L125 PetriNetUnfolderBase]: For 14526/14526 co-relation queries the response was YES. [2024-06-03 22:22:27,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4084 conditions, 702 events. 389/702 cut-off events. For 14526/14526 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3227 event pairs, 64 based on Foata normal form. 1/703 useless extension candidates. Maximal degree in co-relation 4019. Up to 516 conditions per place. [2024-06-03 22:22:27,795 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 104 selfloop transitions, 46 changer transitions 0/152 dead transitions. [2024-06-03 22:22:27,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 152 transitions, 1728 flow [2024-06-03 22:22:27,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:27,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 22:22:27,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 22:22:27,797 INFO L175 Difference]: Start difference. First operand has 134 places, 124 transitions, 1207 flow. Second operand 9 states and 111 transitions. [2024-06-03 22:22:27,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 152 transitions, 1728 flow [2024-06-03 22:22:27,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 1657 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:22:27,823 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 1395 flow [2024-06-03 22:22:27,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1395, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2024-06-03 22:22:27,824 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 109 predicate places. [2024-06-03 22:22:27,824 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 1395 flow [2024-06-03 22:22:27,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:27,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:27,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:27,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-03 22:22:27,824 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:27,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1047617711, now seen corresponding path program 6 times [2024-06-03 22:22:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785244261] [2024-06-03 22:22:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:33,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785244261] [2024-06-03 22:22:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785244261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116265467] [2024-06-03 22:22:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:33,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:33,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:34,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:34,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 1395 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:34,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:34,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:34,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:34,404 INFO L124 PetriNetUnfolderBase]: 386/697 cut-off events. [2024-06-03 22:22:34,404 INFO L125 PetriNetUnfolderBase]: For 15264/15264 co-relation queries the response was YES. [2024-06-03 22:22:34,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 697 events. 386/697 cut-off events. For 15264/15264 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3176 event pairs, 77 based on Foata normal form. 2/699 useless extension candidates. Maximal degree in co-relation 4143. Up to 582 conditions per place. [2024-06-03 22:22:34,422 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 111 selfloop transitions, 35 changer transitions 0/148 dead transitions. [2024-06-03 22:22:34,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 148 transitions, 1723 flow [2024-06-03 22:22:34,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-03 22:22:34,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835125448028674 [2024-06-03 22:22:34,428 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 1395 flow. Second operand 9 states and 107 transitions. [2024-06-03 22:22:34,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 148 transitions, 1723 flow [2024-06-03 22:22:34,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 148 transitions, 1673 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 22:22:34,456 INFO L231 Difference]: Finished difference. Result has 143 places, 134 transitions, 1419 flow [2024-06-03 22:22:34,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1419, PETRI_PLACES=143, PETRI_TRANSITIONS=134} [2024-06-03 22:22:34,457 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 113 predicate places. [2024-06-03 22:22:34,458 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 134 transitions, 1419 flow [2024-06-03 22:22:34,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:34,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:34,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:34,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-03 22:22:34,458 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:34,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:34,459 INFO L85 PathProgramCache]: Analyzing trace with hash 176267719, now seen corresponding path program 5 times [2024-06-03 22:22:34,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:34,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222663459] [2024-06-03 22:22:34,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:34,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:40,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:40,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222663459] [2024-06-03 22:22:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222663459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:40,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:40,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044555859] [2024-06-03 22:22:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:40,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:40,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:40,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:40,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 134 transitions, 1419 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:40,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:40,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:40,839 INFO L124 PetriNetUnfolderBase]: 393/709 cut-off events. [2024-06-03 22:22:40,839 INFO L125 PetriNetUnfolderBase]: For 15652/15652 co-relation queries the response was YES. [2024-06-03 22:22:40,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4359 conditions, 709 events. 393/709 cut-off events. For 15652/15652 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3286 event pairs, 67 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 4290. Up to 541 conditions per place. [2024-06-03 22:22:40,844 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 115 selfloop transitions, 42 changer transitions 0/159 dead transitions. [2024-06-03 22:22:40,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 159 transitions, 1928 flow [2024-06-03 22:22:40,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 22:22:40,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-03 22:22:40,846 INFO L175 Difference]: Start difference. First operand has 143 places, 134 transitions, 1419 flow. Second operand 9 states and 121 transitions. [2024-06-03 22:22:40,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 159 transitions, 1928 flow [2024-06-03 22:22:40,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 159 transitions, 1856 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:40,875 INFO L231 Difference]: Finished difference. Result has 146 places, 138 transitions, 1514 flow [2024-06-03 22:22:40,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1349, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1514, PETRI_PLACES=146, PETRI_TRANSITIONS=138} [2024-06-03 22:22:40,876 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 116 predicate places. [2024-06-03 22:22:40,876 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 138 transitions, 1514 flow [2024-06-03 22:22:40,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:40,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:40,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:40,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-03 22:22:40,877 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:40,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash 176445349, now seen corresponding path program 6 times [2024-06-03 22:22:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325604586] [2024-06-03 22:22:40,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:40,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:40,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:47,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:47,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:47,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325604586] [2024-06-03 22:22:47,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325604586] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:47,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:47,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:22:47,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516732275] [2024-06-03 22:22:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:47,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:22:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:47,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:22:47,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:22:47,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:47,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 138 transitions, 1514 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:47,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:47,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:47,690 INFO L124 PetriNetUnfolderBase]: 402/725 cut-off events. [2024-06-03 22:22:47,690 INFO L125 PetriNetUnfolderBase]: For 18051/18051 co-relation queries the response was YES. [2024-06-03 22:22:47,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4569 conditions, 725 events. 402/725 cut-off events. For 18051/18051 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3363 event pairs, 66 based on Foata normal form. 3/728 useless extension candidates. Maximal degree in co-relation 4498. Up to 577 conditions per place. [2024-06-03 22:22:47,696 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 122 selfloop transitions, 39 changer transitions 0/163 dead transitions. [2024-06-03 22:22:47,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 163 transitions, 1972 flow [2024-06-03 22:22:47,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:22:47,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:22:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 22:22:47,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-03 22:22:47,713 INFO L175 Difference]: Start difference. First operand has 146 places, 138 transitions, 1514 flow. Second operand 10 states and 127 transitions. [2024-06-03 22:22:47,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 163 transitions, 1972 flow [2024-06-03 22:22:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 163 transitions, 1857 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-03 22:22:47,747 INFO L231 Difference]: Finished difference. Result has 149 places, 142 transitions, 1559 flow [2024-06-03 22:22:47,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1559, PETRI_PLACES=149, PETRI_TRANSITIONS=142} [2024-06-03 22:22:47,748 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 119 predicate places. [2024-06-03 22:22:47,748 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 142 transitions, 1559 flow [2024-06-03 22:22:47,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:47,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:47,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:47,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-03 22:22:47,749 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:47,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 184315939, now seen corresponding path program 7 times [2024-06-03 22:22:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:47,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583137158] [2024-06-03 22:22:47,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583137158] [2024-06-03 22:22:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583137158] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:53,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619796786] [2024-06-03 22:22:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:53,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:53,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:53,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:53,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:54,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:54,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 142 transitions, 1559 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:54,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:54,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:54,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:54,537 INFO L124 PetriNetUnfolderBase]: 396/715 cut-off events. [2024-06-03 22:22:54,538 INFO L125 PetriNetUnfolderBase]: For 17140/17140 co-relation queries the response was YES. [2024-06-03 22:22:54,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 715 events. 396/715 cut-off events. For 17140/17140 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3325 event pairs, 67 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 4341. Up to 568 conditions per place. [2024-06-03 22:22:54,542 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 123 selfloop transitions, 38 changer transitions 0/163 dead transitions. [2024-06-03 22:22:54,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 163 transitions, 1953 flow [2024-06-03 22:22:54,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:22:54,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:22:54,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-03 22:22:54,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265232974910394 [2024-06-03 22:22:54,543 INFO L175 Difference]: Start difference. First operand has 149 places, 142 transitions, 1559 flow. Second operand 9 states and 119 transitions. [2024-06-03 22:22:54,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 163 transitions, 1953 flow [2024-06-03 22:22:54,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 163 transitions, 1837 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-06-03 22:22:54,575 INFO L231 Difference]: Finished difference. Result has 150 places, 142 transitions, 1527 flow [2024-06-03 22:22:54,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1527, PETRI_PLACES=150, PETRI_TRANSITIONS=142} [2024-06-03 22:22:54,576 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 120 predicate places. [2024-06-03 22:22:54,576 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 142 transitions, 1527 flow [2024-06-03 22:22:54,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:54,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:22:54,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:22:54,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-03 22:22:54,577 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:22:54,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:22:54,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1485588375, now seen corresponding path program 7 times [2024-06-03 22:22:54,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:22:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535033168] [2024-06-03 22:22:54,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:22:54,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:22:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:22:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:22:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:22:59,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535033168] [2024-06-03 22:22:59,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535033168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:22:59,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:22:59,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:22:59,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710568723] [2024-06-03 22:22:59,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:22:59,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:22:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:22:59,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:22:59,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:22:59,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:22:59,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 142 transitions, 1527 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:22:59,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:22:59,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:22:59,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:22:59,988 INFO L124 PetriNetUnfolderBase]: 400/723 cut-off events. [2024-06-03 22:22:59,988 INFO L125 PetriNetUnfolderBase]: For 17425/17425 co-relation queries the response was YES. [2024-06-03 22:22:59,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 723 events. 400/723 cut-off events. For 17425/17425 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3337 event pairs, 51 based on Foata normal form. 2/725 useless extension candidates. Maximal degree in co-relation 4353. Up to 489 conditions per place. [2024-06-03 22:22:59,993 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 108 selfloop transitions, 47 changer transitions 0/157 dead transitions. [2024-06-03 22:22:59,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 1952 flow [2024-06-03 22:22:59,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:22:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:22:59,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:22:59,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-03 22:22:59,994 INFO L175 Difference]: Start difference. First operand has 150 places, 142 transitions, 1527 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:22:59,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 157 transitions, 1952 flow [2024-06-03 22:23:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 157 transitions, 1866 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:00,033 INFO L231 Difference]: Finished difference. Result has 151 places, 143 transitions, 1556 flow [2024-06-03 22:23:00,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1556, PETRI_PLACES=151, PETRI_TRANSITIONS=143} [2024-06-03 22:23:00,044 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-03 22:23:00,044 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 143 transitions, 1556 flow [2024-06-03 22:23:00,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:00,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:00,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:00,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-03 22:23:00,045 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:00,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1485648825, now seen corresponding path program 8 times [2024-06-03 22:23:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156245714] [2024-06-03 22:23:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:04,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156245714] [2024-06-03 22:23:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156245714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620662660] [2024-06-03 22:23:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:04,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:04,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:04,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:04,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:04,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 143 transitions, 1556 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:04,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:04,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:04,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:05,208 INFO L124 PetriNetUnfolderBase]: 404/731 cut-off events. [2024-06-03 22:23:05,208 INFO L125 PetriNetUnfolderBase]: For 18337/18337 co-relation queries the response was YES. [2024-06-03 22:23:05,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4519 conditions, 731 events. 404/731 cut-off events. For 18337/18337 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3395 event pairs, 78 based on Foata normal form. 2/733 useless extension candidates. Maximal degree in co-relation 4445. Up to 600 conditions per place. [2024-06-03 22:23:05,213 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 114 selfloop transitions, 40 changer transitions 0/156 dead transitions. [2024-06-03 22:23:05,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 156 transitions, 1907 flow [2024-06-03 22:23:05,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-03 22:23:05,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911290322580645 [2024-06-03 22:23:05,216 INFO L175 Difference]: Start difference. First operand has 151 places, 143 transitions, 1556 flow. Second operand 8 states and 97 transitions. [2024-06-03 22:23:05,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 156 transitions, 1907 flow [2024-06-03 22:23:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 156 transitions, 1821 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:05,254 INFO L231 Difference]: Finished difference. Result has 151 places, 144 transitions, 1573 flow [2024-06-03 22:23:05,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1471, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1573, PETRI_PLACES=151, PETRI_TRANSITIONS=144} [2024-06-03 22:23:05,254 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 121 predicate places. [2024-06-03 22:23:05,255 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 1573 flow [2024-06-03 22:23:05,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:05,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:05,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:05,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-03 22:23:05,255 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:05,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash -768338773, now seen corresponding path program 8 times [2024-06-03 22:23:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802695995] [2024-06-03 22:23:05,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:05,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:10,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:10,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:10,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802695995] [2024-06-03 22:23:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802695995] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:10,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:10,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027789533] [2024-06-03 22:23:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:10,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:10,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:10,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:10,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:10,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:10,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 1573 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:10,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:10,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:10,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:10,974 INFO L124 PetriNetUnfolderBase]: 417/752 cut-off events. [2024-06-03 22:23:10,974 INFO L125 PetriNetUnfolderBase]: For 17200/17200 co-relation queries the response was YES. [2024-06-03 22:23:10,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4617 conditions, 752 events. 417/752 cut-off events. For 17200/17200 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3511 event pairs, 82 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 4545. Up to 421 conditions per place. [2024-06-03 22:23:10,980 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 79 selfloop transitions, 81 changer transitions 0/162 dead transitions. [2024-06-03 22:23:10,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 162 transitions, 2033 flow [2024-06-03 22:23:10,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 22:23:10,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-03 22:23:10,981 INFO L175 Difference]: Start difference. First operand has 151 places, 144 transitions, 1573 flow. Second operand 8 states and 105 transitions. [2024-06-03 22:23:10,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 162 transitions, 2033 flow [2024-06-03 22:23:11,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 162 transitions, 1943 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:11,017 INFO L231 Difference]: Finished difference. Result has 152 places, 148 transitions, 1754 flow [2024-06-03 22:23:11,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1754, PETRI_PLACES=152, PETRI_TRANSITIONS=148} [2024-06-03 22:23:11,017 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 122 predicate places. [2024-06-03 22:23:11,017 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 148 transitions, 1754 flow [2024-06-03 22:23:11,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:11,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:11,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:11,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-03 22:23:11,018 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:11,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash -768218803, now seen corresponding path program 9 times [2024-06-03 22:23:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074308313] [2024-06-03 22:23:11,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:15,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:15,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074308313] [2024-06-03 22:23:15,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074308313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:15,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:15,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:15,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216742237] [2024-06-03 22:23:15,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:15,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:15,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:15,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:16,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:16,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 148 transitions, 1754 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:16,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:16,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:16,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:16,353 INFO L124 PetriNetUnfolderBase]: 434/780 cut-off events. [2024-06-03 22:23:16,354 INFO L125 PetriNetUnfolderBase]: For 18764/18764 co-relation queries the response was YES. [2024-06-03 22:23:16,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4975 conditions, 780 events. 434/780 cut-off events. For 18764/18764 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3672 event pairs, 75 based on Foata normal form. 3/783 useless extension candidates. Maximal degree in co-relation 4903. Up to 542 conditions per place. [2024-06-03 22:23:16,359 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 109 selfloop transitions, 62 changer transitions 0/173 dead transitions. [2024-06-03 22:23:16,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 173 transitions, 2290 flow [2024-06-03 22:23:16,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 105 transitions. [2024-06-03 22:23:16,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42338709677419356 [2024-06-03 22:23:16,360 INFO L175 Difference]: Start difference. First operand has 152 places, 148 transitions, 1754 flow. Second operand 8 states and 105 transitions. [2024-06-03 22:23:16,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 173 transitions, 2290 flow [2024-06-03 22:23:16,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 173 transitions, 2168 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:23:16,399 INFO L231 Difference]: Finished difference. Result has 156 places, 157 transitions, 1916 flow [2024-06-03 22:23:16,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1640, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1916, PETRI_PLACES=156, PETRI_TRANSITIONS=157} [2024-06-03 22:23:16,400 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 126 predicate places. [2024-06-03 22:23:16,400 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 157 transitions, 1916 flow [2024-06-03 22:23:16,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:16,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:16,401 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:16,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-03 22:23:16,401 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:16,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:16,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1488445335, now seen corresponding path program 9 times [2024-06-03 22:23:16,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:16,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623831729] [2024-06-03 22:23:16,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:16,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:22,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:22,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623831729] [2024-06-03 22:23:22,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623831729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:22,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:22,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:22,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125593036] [2024-06-03 22:23:22,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:22,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:22,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:22,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:22,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:22,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:22,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 157 transitions, 1916 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:22,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:22,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:22,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:22,826 INFO L124 PetriNetUnfolderBase]: 431/775 cut-off events. [2024-06-03 22:23:22,827 INFO L125 PetriNetUnfolderBase]: For 17430/17430 co-relation queries the response was YES. [2024-06-03 22:23:22,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5109 conditions, 775 events. 431/775 cut-off events. For 17430/17430 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3632 event pairs, 85 based on Foata normal form. 2/777 useless extension candidates. Maximal degree in co-relation 5035. Up to 688 conditions per place. [2024-06-03 22:23:22,832 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 135 selfloop transitions, 30 changer transitions 0/167 dead transitions. [2024-06-03 22:23:22,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 167 transitions, 2270 flow [2024-06-03 22:23:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-03 22:23:22,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3790322580645161 [2024-06-03 22:23:22,834 INFO L175 Difference]: Start difference. First operand has 156 places, 157 transitions, 1916 flow. Second operand 8 states and 94 transitions. [2024-06-03 22:23:22,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 167 transitions, 2270 flow [2024-06-03 22:23:22,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 167 transitions, 2180 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-03 22:23:22,873 INFO L231 Difference]: Finished difference. Result has 159 places, 157 transitions, 1892 flow [2024-06-03 22:23:22,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1826, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1892, PETRI_PLACES=159, PETRI_TRANSITIONS=157} [2024-06-03 22:23:22,874 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-03 22:23:22,874 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 157 transitions, 1892 flow [2024-06-03 22:23:22,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:22,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:22,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:22,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-03 22:23:22,875 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:22,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:22,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1599267979, now seen corresponding path program 10 times [2024-06-03 22:23:22,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:22,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552531248] [2024-06-03 22:23:22,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:22,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:27,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552531248] [2024-06-03 22:23:27,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552531248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:27,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:27,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:27,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434501738] [2024-06-03 22:23:27,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:27,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:27,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:27,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:27,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:28,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:28,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 157 transitions, 1892 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:28,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:28,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:28,415 INFO L124 PetriNetUnfolderBase]: 434/780 cut-off events. [2024-06-03 22:23:28,416 INFO L125 PetriNetUnfolderBase]: For 16969/16969 co-relation queries the response was YES. [2024-06-03 22:23:28,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 780 events. 434/780 cut-off events. For 16969/16969 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3691 event pairs, 73 based on Foata normal form. 1/781 useless extension candidates. Maximal degree in co-relation 4987. Up to 550 conditions per place. [2024-06-03 22:23:28,420 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 107 selfloop transitions, 64 changer transitions 0/173 dead transitions. [2024-06-03 22:23:28,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 173 transitions, 2312 flow [2024-06-03 22:23:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2024-06-03 22:23:28,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:23:28,422 INFO L175 Difference]: Start difference. First operand has 159 places, 157 transitions, 1892 flow. Second operand 8 states and 104 transitions. [2024-06-03 22:23:28,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 173 transitions, 2312 flow [2024-06-03 22:23:28,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 173 transitions, 2226 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:28,456 INFO L231 Difference]: Finished difference. Result has 159 places, 159 transitions, 1974 flow [2024-06-03 22:23:28,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1806, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1974, PETRI_PLACES=159, PETRI_TRANSITIONS=159} [2024-06-03 22:23:28,456 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 129 predicate places. [2024-06-03 22:23:28,456 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 159 transitions, 1974 flow [2024-06-03 22:23:28,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:28,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:28,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:28,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-03 22:23:28,457 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:28,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1443349887, now seen corresponding path program 11 times [2024-06-03 22:23:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:28,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874378912] [2024-06-03 22:23:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:33,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874378912] [2024-06-03 22:23:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874378912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115607830] [2024-06-03 22:23:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:33,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:33,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:33,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 159 transitions, 1974 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:33,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:33,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:33,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:34,112 INFO L124 PetriNetUnfolderBase]: 437/785 cut-off events. [2024-06-03 22:23:34,112 INFO L125 PetriNetUnfolderBase]: For 17001/17001 co-relation queries the response was YES. [2024-06-03 22:23:34,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5168 conditions, 785 events. 437/785 cut-off events. For 17001/17001 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3725 event pairs, 63 based on Foata normal form. 1/786 useless extension candidates. Maximal degree in co-relation 5093. Up to 501 conditions per place. [2024-06-03 22:23:34,117 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 102 selfloop transitions, 77 changer transitions 0/181 dead transitions. [2024-06-03 22:23:34,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 181 transitions, 2502 flow [2024-06-03 22:23:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:34,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:34,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-03 22:23:34,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 22:23:34,119 INFO L175 Difference]: Start difference. First operand has 159 places, 159 transitions, 1974 flow. Second operand 8 states and 112 transitions. [2024-06-03 22:23:34,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 181 transitions, 2502 flow [2024-06-03 22:23:34,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 181 transitions, 2363 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:34,156 INFO L231 Difference]: Finished difference. Result has 160 places, 161 transitions, 2031 flow [2024-06-03 22:23:34,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1837, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2031, PETRI_PLACES=160, PETRI_TRANSITIONS=161} [2024-06-03 22:23:34,157 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2024-06-03 22:23:34,157 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 161 transitions, 2031 flow [2024-06-03 22:23:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:34,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:34,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:34,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-03 22:23:34,158 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:34,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1603741279, now seen corresponding path program 12 times [2024-06-03 22:23:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:34,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691685526] [2024-06-03 22:23:34,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:38,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:38,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691685526] [2024-06-03 22:23:38,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691685526] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:38,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:23:38,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275311776] [2024-06-03 22:23:38,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:38,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:23:38,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:38,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:23:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:23:38,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:38,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 161 transitions, 2031 flow. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:38,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:38,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:38,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:39,077 INFO L124 PetriNetUnfolderBase]: 446/802 cut-off events. [2024-06-03 22:23:39,078 INFO L125 PetriNetUnfolderBase]: For 18069/18069 co-relation queries the response was YES. [2024-06-03 22:23:39,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5325 conditions, 802 events. 446/802 cut-off events. For 18069/18069 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3840 event pairs, 77 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 5250. Up to 582 conditions per place. [2024-06-03 22:23:39,083 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 122 selfloop transitions, 61 changer transitions 0/185 dead transitions. [2024-06-03 22:23:39,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 185 transitions, 2545 flow [2024-06-03 22:23:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:23:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:23:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 108 transitions. [2024-06-03 22:23:39,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43548387096774194 [2024-06-03 22:23:39,085 INFO L175 Difference]: Start difference. First operand has 160 places, 161 transitions, 2031 flow. Second operand 8 states and 108 transitions. [2024-06-03 22:23:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 185 transitions, 2545 flow [2024-06-03 22:23:39,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 185 transitions, 2348 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:39,125 INFO L231 Difference]: Finished difference. Result has 161 places, 165 transitions, 2042 flow [2024-06-03 22:23:39,125 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2042, PETRI_PLACES=161, PETRI_TRANSITIONS=165} [2024-06-03 22:23:39,125 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2024-06-03 22:23:39,126 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 165 transitions, 2042 flow [2024-06-03 22:23:39,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:39,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:39,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:39,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-03 22:23:39,126 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:39,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:39,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1443527517, now seen corresponding path program 13 times [2024-06-03 22:23:39,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:39,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411449799] [2024-06-03 22:23:39,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:39,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:44,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:44,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411449799] [2024-06-03 22:23:44,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411449799] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:44,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:44,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996456607] [2024-06-03 22:23:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:44,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:44,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:44,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 165 transitions, 2042 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:44,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:44,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:44,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:44,836 INFO L124 PetriNetUnfolderBase]: 455/815 cut-off events. [2024-06-03 22:23:44,836 INFO L125 PetriNetUnfolderBase]: For 18304/18304 co-relation queries the response was YES. [2024-06-03 22:23:44,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5371 conditions, 815 events. 455/815 cut-off events. For 18304/18304 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3892 event pairs, 70 based on Foata normal form. 3/818 useless extension candidates. Maximal degree in co-relation 5296. Up to 597 conditions per place. [2024-06-03 22:23:44,842 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 127 selfloop transitions, 58 changer transitions 0/187 dead transitions. [2024-06-03 22:23:44,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 187 transitions, 2548 flow [2024-06-03 22:23:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:44,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:44,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 22:23:44,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-03 22:23:44,844 INFO L175 Difference]: Start difference. First operand has 161 places, 165 transitions, 2042 flow. Second operand 9 states and 114 transitions. [2024-06-03 22:23:44,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 187 transitions, 2548 flow [2024-06-03 22:23:44,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 187 transitions, 2406 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:44,881 INFO L231 Difference]: Finished difference. Result has 163 places, 169 transitions, 2102 flow [2024-06-03 22:23:44,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1900, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2102, PETRI_PLACES=163, PETRI_TRANSITIONS=169} [2024-06-03 22:23:44,882 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 133 predicate places. [2024-06-03 22:23:44,882 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 169 transitions, 2102 flow [2024-06-03 22:23:44,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:44,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:44,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:44,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-03 22:23:44,883 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:44,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 437103439, now seen corresponding path program 14 times [2024-06-03 22:23:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:44,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911342229] [2024-06-03 22:23:44,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:44,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:50,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:50,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911342229] [2024-06-03 22:23:50,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911342229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:50,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:50,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:50,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025691814] [2024-06-03 22:23:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:50,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:50,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:50,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 169 transitions, 2102 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:50,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:50,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:50,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:50,579 INFO L124 PetriNetUnfolderBase]: 464/830 cut-off events. [2024-06-03 22:23:50,580 INFO L125 PetriNetUnfolderBase]: For 18659/18659 co-relation queries the response was YES. [2024-06-03 22:23:50,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5478 conditions, 830 events. 464/830 cut-off events. For 18659/18659 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3966 event pairs, 147 based on Foata normal form. 3/833 useless extension candidates. Maximal degree in co-relation 5403. Up to 777 conditions per place. [2024-06-03 22:23:50,586 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 166 selfloop transitions, 18 changer transitions 0/186 dead transitions. [2024-06-03 22:23:50,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 186 transitions, 2590 flow [2024-06-03 22:23:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:50,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 22:23:50,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-03 22:23:50,588 INFO L175 Difference]: Start difference. First operand has 163 places, 169 transitions, 2102 flow. Second operand 9 states and 102 transitions. [2024-06-03 22:23:50,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 186 transitions, 2590 flow [2024-06-03 22:23:50,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 186 transitions, 2446 flow, removed 17 selfloop flow, removed 8 redundant places. [2024-06-03 22:23:50,628 INFO L231 Difference]: Finished difference. Result has 164 places, 173 transitions, 2082 flow [2024-06-03 22:23:50,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2082, PETRI_PLACES=164, PETRI_TRANSITIONS=173} [2024-06-03 22:23:50,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2024-06-03 22:23:50,629 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 173 transitions, 2082 flow [2024-06-03 22:23:50,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:50,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:50,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:50,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-03 22:23:50,629 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:50,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:50,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1119811021, now seen corresponding path program 15 times [2024-06-03 22:23:50,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:50,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788205180] [2024-06-03 22:23:50,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:50,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:23:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:23:55,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:23:55,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788205180] [2024-06-03 22:23:55,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788205180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:23:55,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:23:55,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:23:55,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971626329] [2024-06-03 22:23:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:23:55,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:23:55,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:23:55,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:23:55,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:23:55,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:23:55,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 173 transitions, 2082 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:55,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:23:55,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:23:55,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:23:56,300 INFO L124 PetriNetUnfolderBase]: 458/821 cut-off events. [2024-06-03 22:23:56,300 INFO L125 PetriNetUnfolderBase]: For 16490/16490 co-relation queries the response was YES. [2024-06-03 22:23:56,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5189 conditions, 821 events. 458/821 cut-off events. For 16490/16490 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 3913 event pairs, 142 based on Foata normal form. 3/824 useless extension candidates. Maximal degree in co-relation 5114. Up to 756 conditions per place. [2024-06-03 22:23:56,306 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 165 selfloop transitions, 21 changer transitions 0/188 dead transitions. [2024-06-03 22:23:56,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 188 transitions, 2515 flow [2024-06-03 22:23:56,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:23:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:23:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-03 22:23:56,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37992831541218636 [2024-06-03 22:23:56,308 INFO L175 Difference]: Start difference. First operand has 164 places, 173 transitions, 2082 flow. Second operand 9 states and 106 transitions. [2024-06-03 22:23:56,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 188 transitions, 2515 flow [2024-06-03 22:23:56,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 188 transitions, 2419 flow, removed 33 selfloop flow, removed 7 redundant places. [2024-06-03 22:23:56,347 INFO L231 Difference]: Finished difference. Result has 166 places, 173 transitions, 2036 flow [2024-06-03 22:23:56,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1986, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2036, PETRI_PLACES=166, PETRI_TRANSITIONS=173} [2024-06-03 22:23:56,348 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 136 predicate places. [2024-06-03 22:23:56,348 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 173 transitions, 2036 flow [2024-06-03 22:23:56,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:23:56,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:23:56,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:23:56,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-03 22:23:56,349 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:23:56,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:23:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1355993077, now seen corresponding path program 1 times [2024-06-03 22:23:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:23:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694242168] [2024-06-03 22:23:56,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:23:56,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:23:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:00,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694242168] [2024-06-03 22:24:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694242168] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642826920] [2024-06-03 22:24:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:00,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:00,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:00,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 173 transitions, 2036 flow. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:00,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:00,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:00,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:01,189 INFO L124 PetriNetUnfolderBase]: 452/812 cut-off events. [2024-06-03 22:24:01,189 INFO L125 PetriNetUnfolderBase]: For 15350/15350 co-relation queries the response was YES. [2024-06-03 22:24:01,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5022 conditions, 812 events. 452/812 cut-off events. For 15350/15350 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3856 event pairs, 149 based on Foata normal form. 3/815 useless extension candidates. Maximal degree in co-relation 4946. Up to 766 conditions per place. [2024-06-03 22:24:01,195 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 20 changer transitions 0/185 dead transitions. [2024-06-03 22:24:01,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 185 transitions, 2448 flow [2024-06-03 22:24:01,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:01,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2024-06-03 22:24:01,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2024-06-03 22:24:01,197 INFO L175 Difference]: Start difference. First operand has 166 places, 173 transitions, 2036 flow. Second operand 10 states and 106 transitions. [2024-06-03 22:24:01,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 185 transitions, 2448 flow [2024-06-03 22:24:01,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 185 transitions, 2299 flow, removed 20 selfloop flow, removed 9 redundant places. [2024-06-03 22:24:01,232 INFO L231 Difference]: Finished difference. Result has 167 places, 175 transitions, 1958 flow [2024-06-03 22:24:01,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1958, PETRI_PLACES=167, PETRI_TRANSITIONS=175} [2024-06-03 22:24:01,233 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-03 22:24:01,233 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 175 transitions, 1958 flow [2024-06-03 22:24:01,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:01,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:01,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:01,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-03 22:24:01,234 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:01,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2123210819, now seen corresponding path program 1 times [2024-06-03 22:24:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:01,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361299511] [2024-06-03 22:24:01,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:07,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361299511] [2024-06-03 22:24:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361299511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:07,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:07,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988333920] [2024-06-03 22:24:07,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:07,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:07,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:07,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:07,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:07,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:07,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 175 transitions, 1958 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:07,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:07,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:07,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:08,269 INFO L124 PetriNetUnfolderBase]: 492/894 cut-off events. [2024-06-03 22:24:08,269 INFO L125 PetriNetUnfolderBase]: For 22648/22648 co-relation queries the response was YES. [2024-06-03 22:24:08,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5587 conditions, 894 events. 492/894 cut-off events. For 22648/22648 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4365 event pairs, 96 based on Foata normal form. 2/896 useless extension candidates. Maximal degree in co-relation 5511. Up to 538 conditions per place. [2024-06-03 22:24:08,276 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 147 selfloop transitions, 55 changer transitions 0/204 dead transitions. [2024-06-03 22:24:08,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 204 transitions, 2554 flow [2024-06-03 22:24:08,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:08,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 22:24:08,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-03 22:24:08,277 INFO L175 Difference]: Start difference. First operand has 167 places, 175 transitions, 1958 flow. Second operand 10 states and 132 transitions. [2024-06-03 22:24:08,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 204 transitions, 2554 flow [2024-06-03 22:24:08,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 204 transitions, 2501 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:08,325 INFO L231 Difference]: Finished difference. Result has 169 places, 177 transitions, 2037 flow [2024-06-03 22:24:08,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2037, PETRI_PLACES=169, PETRI_TRANSITIONS=177} [2024-06-03 22:24:08,326 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 139 predicate places. [2024-06-03 22:24:08,326 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 177 transitions, 2037 flow [2024-06-03 22:24:08,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:08,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:08,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-03 22:24:08,326 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:08,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2126277781, now seen corresponding path program 2 times [2024-06-03 22:24:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948503788] [2024-06-03 22:24:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:15,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:15,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:15,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948503788] [2024-06-03 22:24:15,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948503788] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:15,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775101003] [2024-06-03 22:24:15,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:15,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:15,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:15,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:15,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:15,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 177 transitions, 2037 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:15,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:15,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:15,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:15,784 INFO L124 PetriNetUnfolderBase]: 496/902 cut-off events. [2024-06-03 22:24:15,784 INFO L125 PetriNetUnfolderBase]: For 24264/24264 co-relation queries the response was YES. [2024-06-03 22:24:15,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5760 conditions, 902 events. 496/902 cut-off events. For 24264/24264 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4433 event pairs, 104 based on Foata normal form. 2/904 useless extension candidates. Maximal degree in co-relation 5683. Up to 695 conditions per place. [2024-06-03 22:24:15,791 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 55 changer transitions 0/197 dead transitions. [2024-06-03 22:24:15,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 197 transitions, 2501 flow [2024-06-03 22:24:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:24:15,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:24:15,793 INFO L175 Difference]: Start difference. First operand has 169 places, 177 transitions, 2037 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:24:15,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 197 transitions, 2501 flow [2024-06-03 22:24:15,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 197 transitions, 2427 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-03 22:24:15,843 INFO L231 Difference]: Finished difference. Result has 173 places, 178 transitions, 2089 flow [2024-06-03 22:24:15,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2089, PETRI_PLACES=173, PETRI_TRANSITIONS=178} [2024-06-03 22:24:15,844 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 143 predicate places. [2024-06-03 22:24:15,844 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 178 transitions, 2089 flow [2024-06-03 22:24:15,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:15,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:15,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:15,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-03 22:24:15,845 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:15,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:15,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2126274061, now seen corresponding path program 3 times [2024-06-03 22:24:15,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:15,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99588580] [2024-06-03 22:24:15,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:15,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:22,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99588580] [2024-06-03 22:24:22,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99588580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:22,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:22,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:22,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109276848] [2024-06-03 22:24:22,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:22,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:22,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:22,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:22,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:22,675 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:22,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 178 transitions, 2089 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:22,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:22,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:22,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:23,037 INFO L124 PetriNetUnfolderBase]: 500/910 cut-off events. [2024-06-03 22:24:23,037 INFO L125 PetriNetUnfolderBase]: For 25566/25566 co-relation queries the response was YES. [2024-06-03 22:24:23,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5931 conditions, 910 events. 500/910 cut-off events. For 25566/25566 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4490 event pairs, 102 based on Foata normal form. 2/912 useless extension candidates. Maximal degree in co-relation 5852. Up to 689 conditions per place. [2024-06-03 22:24:23,046 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 141 selfloop transitions, 56 changer transitions 0/199 dead transitions. [2024-06-03 22:24:23,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 199 transitions, 2561 flow [2024-06-03 22:24:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:24:23,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:24:23,048 INFO L175 Difference]: Start difference. First operand has 173 places, 178 transitions, 2089 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:24:23,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 199 transitions, 2561 flow [2024-06-03 22:24:23,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 199 transitions, 2447 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:23,101 INFO L231 Difference]: Finished difference. Result has 175 places, 179 transitions, 2105 flow [2024-06-03 22:24:23,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1975, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2105, PETRI_PLACES=175, PETRI_TRANSITIONS=179} [2024-06-03 22:24:23,101 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 145 predicate places. [2024-06-03 22:24:23,102 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 179 transitions, 2105 flow [2024-06-03 22:24:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:23,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:23,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:23,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-03 22:24:23,102 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:23,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:23,103 INFO L85 PathProgramCache]: Analyzing trace with hash -56260730, now seen corresponding path program 1 times [2024-06-03 22:24:23,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:23,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983210469] [2024-06-03 22:24:23,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:23,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:28,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983210469] [2024-06-03 22:24:28,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983210469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:28,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:28,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014582587] [2024-06-03 22:24:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:28,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:28,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:28,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:28,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 179 transitions, 2105 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:28,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:28,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:28,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:28,823 INFO L124 PetriNetUnfolderBase]: 516/936 cut-off events. [2024-06-03 22:24:28,823 INFO L125 PetriNetUnfolderBase]: For 28264/28264 co-relation queries the response was YES. [2024-06-03 22:24:28,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6176 conditions, 936 events. 516/936 cut-off events. For 28264/28264 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4635 event pairs, 109 based on Foata normal form. 2/938 useless extension candidates. Maximal degree in co-relation 6096. Up to 635 conditions per place. [2024-06-03 22:24:28,830 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 132 selfloop transitions, 68 changer transitions 0/202 dead transitions. [2024-06-03 22:24:28,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 202 transitions, 2691 flow [2024-06-03 22:24:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:24:28,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 22:24:28,833 INFO L175 Difference]: Start difference. First operand has 175 places, 179 transitions, 2105 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:24:28,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 202 transitions, 2691 flow [2024-06-03 22:24:28,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 202 transitions, 2573 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:28,889 INFO L231 Difference]: Finished difference. Result has 177 places, 183 transitions, 2184 flow [2024-06-03 22:24:28,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1987, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2184, PETRI_PLACES=177, PETRI_TRANSITIONS=183} [2024-06-03 22:24:28,889 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 147 predicate places. [2024-06-03 22:24:28,890 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 183 transitions, 2184 flow [2024-06-03 22:24:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:28,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:28,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:28,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-03 22:24:28,890 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:28,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 881459563, now seen corresponding path program 4 times [2024-06-03 22:24:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306968652] [2024-06-03 22:24:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:35,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:35,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:35,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306968652] [2024-06-03 22:24:35,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306968652] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:35,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:35,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:35,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925612609] [2024-06-03 22:24:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:35,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:35,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:35,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:35,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:35,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:35,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 183 transitions, 2184 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:35,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:35,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:35,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:36,099 INFO L124 PetriNetUnfolderBase]: 536/978 cut-off events. [2024-06-03 22:24:36,100 INFO L125 PetriNetUnfolderBase]: For 37735/37735 co-relation queries the response was YES. [2024-06-03 22:24:36,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6427 conditions, 978 events. 536/978 cut-off events. For 37735/37735 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4932 event pairs, 104 based on Foata normal form. 12/990 useless extension candidates. Maximal degree in co-relation 6346. Up to 783 conditions per place. [2024-06-03 22:24:36,106 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 161 selfloop transitions, 37 changer transitions 8/208 dead transitions. [2024-06-03 22:24:36,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 208 transitions, 2717 flow [2024-06-03 22:24:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:36,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:24:36,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 22:24:36,107 INFO L175 Difference]: Start difference. First operand has 177 places, 183 transitions, 2184 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:24:36,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 208 transitions, 2717 flow [2024-06-03 22:24:36,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 208 transitions, 2662 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-03 22:24:36,182 INFO L231 Difference]: Finished difference. Result has 182 places, 181 transitions, 2183 flow [2024-06-03 22:24:36,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2183, PETRI_PLACES=182, PETRI_TRANSITIONS=181} [2024-06-03 22:24:36,182 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-03 22:24:36,182 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 181 transitions, 2183 flow [2024-06-03 22:24:36,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:36,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:36,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:36,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-03 22:24:36,183 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:36,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:36,184 INFO L85 PathProgramCache]: Analyzing trace with hash 493580898, now seen corresponding path program 2 times [2024-06-03 22:24:36,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293631189] [2024-06-03 22:24:36,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:41,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:41,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293631189] [2024-06-03 22:24:41,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293631189] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:41,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:41,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:41,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708925319] [2024-06-03 22:24:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:41,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:41,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:41,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:42,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:42,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 181 transitions, 2183 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:42,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:42,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:42,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:42,512 INFO L124 PetriNetUnfolderBase]: 516/938 cut-off events. [2024-06-03 22:24:42,512 INFO L125 PetriNetUnfolderBase]: For 31640/31640 co-relation queries the response was YES. [2024-06-03 22:24:42,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6357 conditions, 938 events. 516/938 cut-off events. For 31640/31640 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 4675 event pairs, 96 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 6274. Up to 733 conditions per place. [2024-06-03 22:24:42,519 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 149 selfloop transitions, 49 changer transitions 0/200 dead transitions. [2024-06-03 22:24:42,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 200 transitions, 2658 flow [2024-06-03 22:24:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:24:42,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:24:42,520 INFO L175 Difference]: Start difference. First operand has 182 places, 181 transitions, 2183 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:24:42,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 200 transitions, 2658 flow [2024-06-03 22:24:42,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 200 transitions, 2576 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:42,580 INFO L231 Difference]: Finished difference. Result has 184 places, 183 transitions, 2234 flow [2024-06-03 22:24:42,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2101, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2234, PETRI_PLACES=184, PETRI_TRANSITIONS=183} [2024-06-03 22:24:42,581 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 154 predicate places. [2024-06-03 22:24:42,581 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 183 transitions, 2234 flow [2024-06-03 22:24:42,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:42,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:42,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:42,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-03 22:24:42,582 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:42,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997705, now seen corresponding path program 5 times [2024-06-03 22:24:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:42,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237779462] [2024-06-03 22:24:42,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:42,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:49,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:49,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:49,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237779462] [2024-06-03 22:24:49,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237779462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:49,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:49,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:49,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116943318] [2024-06-03 22:24:49,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:49,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:49,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:49,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:49,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:49,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 183 transitions, 2234 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:49,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:49,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:49,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:49,627 INFO L124 PetriNetUnfolderBase]: 520/946 cut-off events. [2024-06-03 22:24:49,628 INFO L125 PetriNetUnfolderBase]: For 33253/33253 co-relation queries the response was YES. [2024-06-03 22:24:49,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6453 conditions, 946 events. 520/946 cut-off events. For 33253/33253 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4740 event pairs, 101 based on Foata normal form. 2/948 useless extension candidates. Maximal degree in co-relation 6369. Up to 786 conditions per place. [2024-06-03 22:24:49,635 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 161 selfloop transitions, 43 changer transitions 0/206 dead transitions. [2024-06-03 22:24:49,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 206 transitions, 2743 flow [2024-06-03 22:24:49,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:49,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:24:49,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:24:49,637 INFO L175 Difference]: Start difference. First operand has 184 places, 183 transitions, 2234 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:24:49,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 206 transitions, 2743 flow [2024-06-03 22:24:49,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 206 transitions, 2630 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:24:49,699 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 2262 flow [2024-06-03 22:24:49,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2262, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2024-06-03 22:24:49,700 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 157 predicate places. [2024-06-03 22:24:49,700 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 2262 flow [2024-06-03 22:24:49,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:49,700 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:49,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:49,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-03 22:24:49,701 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2081997550, now seen corresponding path program 3 times [2024-06-03 22:24:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:49,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020966059] [2024-06-03 22:24:49,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:49,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:24:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:24:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:24:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020966059] [2024-06-03 22:24:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020966059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:24:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:24:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:24:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106684931] [2024-06-03 22:24:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:24:54,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:24:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:24:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:24:54,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:24:54,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:24:54,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 2262 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:54,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:24:54,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:24:54,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:24:55,323 INFO L124 PetriNetUnfolderBase]: 526/956 cut-off events. [2024-06-03 22:24:55,324 INFO L125 PetriNetUnfolderBase]: For 34694/34694 co-relation queries the response was YES. [2024-06-03 22:24:55,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6630 conditions, 956 events. 526/956 cut-off events. For 34694/34694 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4764 event pairs, 98 based on Foata normal form. 2/958 useless extension candidates. Maximal degree in co-relation 6544. Up to 739 conditions per place. [2024-06-03 22:24:55,330 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 151 selfloop transitions, 53 changer transitions 0/206 dead transitions. [2024-06-03 22:24:55,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 206 transitions, 2767 flow [2024-06-03 22:24:55,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:24:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:24:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:24:55,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 22:24:55,331 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 2262 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:24:55,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 206 transitions, 2767 flow [2024-06-03 22:24:55,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 206 transitions, 2686 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-06-03 22:24:55,397 INFO L231 Difference]: Finished difference. Result has 190 places, 188 transitions, 2326 flow [2024-06-03 22:24:55,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2181, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2326, PETRI_PLACES=190, PETRI_TRANSITIONS=188} [2024-06-03 22:24:55,398 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 160 predicate places. [2024-06-03 22:24:55,398 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 188 transitions, 2326 flow [2024-06-03 22:24:55,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:24:55,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:24:55,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:24:55,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-03 22:24:55,398 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:24:55,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:24:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 493432873, now seen corresponding path program 6 times [2024-06-03 22:24:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:24:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790501854] [2024-06-03 22:24:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:24:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:24:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790501854] [2024-06-03 22:25:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790501854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122120629] [2024-06-03 22:25:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:02,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:02,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:02,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:02,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:02,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 188 transitions, 2326 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:02,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:02,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:02,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:02,748 INFO L124 PetriNetUnfolderBase]: 530/964 cut-off events. [2024-06-03 22:25:02,748 INFO L125 PetriNetUnfolderBase]: For 36620/36620 co-relation queries the response was YES. [2024-06-03 22:25:02,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6729 conditions, 964 events. 530/964 cut-off events. For 36620/36620 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4864 event pairs, 102 based on Foata normal form. 2/966 useless extension candidates. Maximal degree in co-relation 6642. Up to 793 conditions per place. [2024-06-03 22:25:02,754 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 165 selfloop transitions, 42 changer transitions 0/209 dead transitions. [2024-06-03 22:25:02,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 209 transitions, 2831 flow [2024-06-03 22:25:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:02,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 22:25:02,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 22:25:02,761 INFO L175 Difference]: Start difference. First operand has 190 places, 188 transitions, 2326 flow. Second operand 10 states and 125 transitions. [2024-06-03 22:25:02,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 209 transitions, 2831 flow [2024-06-03 22:25:02,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 209 transitions, 2706 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:02,833 INFO L231 Difference]: Finished difference. Result has 192 places, 189 transitions, 2309 flow [2024-06-03 22:25:02,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2201, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2309, PETRI_PLACES=192, PETRI_TRANSITIONS=189} [2024-06-03 22:25:02,835 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 162 predicate places. [2024-06-03 22:25:02,835 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 189 transitions, 2309 flow [2024-06-03 22:25:02,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:02,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:02,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:02,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-03 22:25:02,836 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:02,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:02,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1566340949, now seen corresponding path program 7 times [2024-06-03 22:25:02,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760251920] [2024-06-03 22:25:02,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:02,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760251920] [2024-06-03 22:25:09,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760251920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:09,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:09,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467717778] [2024-06-03 22:25:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:09,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:09,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:09,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:09,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:09,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 189 transitions, 2309 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:09,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:09,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:09,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:10,203 INFO L124 PetriNetUnfolderBase]: 534/972 cut-off events. [2024-06-03 22:25:10,203 INFO L125 PetriNetUnfolderBase]: For 37837/37837 co-relation queries the response was YES. [2024-06-03 22:25:10,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6758 conditions, 972 events. 534/972 cut-off events. For 37837/37837 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4883 event pairs, 77 based on Foata normal form. 2/974 useless extension candidates. Maximal degree in co-relation 6670. Up to 537 conditions per place. [2024-06-03 22:25:10,211 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 137 selfloop transitions, 74 changer transitions 0/213 dead transitions. [2024-06-03 22:25:10,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 213 transitions, 2909 flow [2024-06-03 22:25:10,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 22:25:10,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 22:25:10,212 INFO L175 Difference]: Start difference. First operand has 192 places, 189 transitions, 2309 flow. Second operand 10 states and 119 transitions. [2024-06-03 22:25:10,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 213 transitions, 2909 flow [2024-06-03 22:25:10,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 213 transitions, 2811 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:10,293 INFO L231 Difference]: Finished difference. Result has 194 places, 190 transitions, 2375 flow [2024-06-03 22:25:10,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=194, PETRI_TRANSITIONS=190} [2024-06-03 22:25:10,294 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 164 predicate places. [2024-06-03 22:25:10,294 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 190 transitions, 2375 flow [2024-06-03 22:25:10,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:10,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:10,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:10,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-03 22:25:10,295 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:10,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:10,295 INFO L85 PathProgramCache]: Analyzing trace with hash -63096817, now seen corresponding path program 8 times [2024-06-03 22:25:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861468489] [2024-06-03 22:25:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:17,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861468489] [2024-06-03 22:25:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861468489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:17,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:17,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603222394] [2024-06-03 22:25:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:17,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:17,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:17,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 190 transitions, 2375 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:17,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:17,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:17,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:17,635 INFO L124 PetriNetUnfolderBase]: 545/993 cut-off events. [2024-06-03 22:25:17,635 INFO L125 PetriNetUnfolderBase]: For 41451/41451 co-relation queries the response was YES. [2024-06-03 22:25:17,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7041 conditions, 993 events. 545/993 cut-off events. For 41451/41451 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5047 event pairs, 99 based on Foata normal form. 2/995 useless extension candidates. Maximal degree in co-relation 6952. Up to 751 conditions per place. [2024-06-03 22:25:17,644 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 67 changer transitions 0/215 dead transitions. [2024-06-03 22:25:17,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 215 transitions, 2995 flow [2024-06-03 22:25:17,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:17,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:17,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2024-06-03 22:25:17,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 22:25:17,646 INFO L175 Difference]: Start difference. First operand has 194 places, 190 transitions, 2375 flow. Second operand 10 states and 125 transitions. [2024-06-03 22:25:17,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 215 transitions, 2995 flow [2024-06-03 22:25:17,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 2856 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-03 22:25:17,722 INFO L231 Difference]: Finished difference. Result has 197 places, 192 transitions, 2400 flow [2024-06-03 22:25:17,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2246, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2400, PETRI_PLACES=197, PETRI_TRANSITIONS=192} [2024-06-03 22:25:17,723 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-03 22:25:17,723 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 192 transitions, 2400 flow [2024-06-03 22:25:17,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:17,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:17,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:17,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-03 22:25:17,723 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:17,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 311466418, now seen corresponding path program 4 times [2024-06-03 22:25:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962314973] [2024-06-03 22:25:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:23,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:23,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:23,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962314973] [2024-06-03 22:25:23,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962314973] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:23,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:23,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:23,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107785031] [2024-06-03 22:25:23,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:23,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:23,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:23,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:23,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 192 transitions, 2400 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:23,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:23,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:23,613 INFO L124 PetriNetUnfolderBase]: 551/1003 cut-off events. [2024-06-03 22:25:23,613 INFO L125 PetriNetUnfolderBase]: For 42752/42752 co-relation queries the response was YES. [2024-06-03 22:25:23,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7107 conditions, 1003 events. 551/1003 cut-off events. For 42752/42752 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5101 event pairs, 103 based on Foata normal form. 2/1005 useless extension candidates. Maximal degree in co-relation 7017. Up to 800 conditions per place. [2024-06-03 22:25:23,622 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 67 changer transitions 0/213 dead transitions. [2024-06-03 22:25:23,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 213 transitions, 2926 flow [2024-06-03 22:25:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:25:23,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:25:23,630 INFO L175 Difference]: Start difference. First operand has 197 places, 192 transitions, 2400 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:25:23,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 213 transitions, 2926 flow [2024-06-03 22:25:23,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 213 transitions, 2829 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-03 22:25:23,716 INFO L231 Difference]: Finished difference. Result has 201 places, 194 transitions, 2476 flow [2024-06-03 22:25:23,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2476, PETRI_PLACES=201, PETRI_TRANSITIONS=194} [2024-06-03 22:25:23,716 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 171 predicate places. [2024-06-03 22:25:23,717 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 194 transitions, 2476 flow [2024-06-03 22:25:23,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:23,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:23,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:23,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-03 22:25:23,717 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:23,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash -61222867, now seen corresponding path program 9 times [2024-06-03 22:25:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:23,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909823502] [2024-06-03 22:25:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:30,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:30,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909823502] [2024-06-03 22:25:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909823502] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:30,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:30,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:30,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124695828] [2024-06-03 22:25:30,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:30,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:30,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:30,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 194 transitions, 2476 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:30,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:30,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:30,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:31,319 INFO L124 PetriNetUnfolderBase]: 555/1011 cut-off events. [2024-06-03 22:25:31,319 INFO L125 PetriNetUnfolderBase]: For 44266/44266 co-relation queries the response was YES. [2024-06-03 22:25:31,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 1011 events. 555/1011 cut-off events. For 44266/44266 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5162 event pairs, 101 based on Foata normal form. 2/1013 useless extension candidates. Maximal degree in co-relation 7200. Up to 791 conditions per place. [2024-06-03 22:25:31,327 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 147 selfloop transitions, 67 changer transitions 0/216 dead transitions. [2024-06-03 22:25:31,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 216 transitions, 3079 flow [2024-06-03 22:25:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:31,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:25:31,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-03 22:25:31,330 INFO L175 Difference]: Start difference. First operand has 201 places, 194 transitions, 2476 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:25:31,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 216 transitions, 3079 flow [2024-06-03 22:25:31,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 216 transitions, 2924 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:31,418 INFO L231 Difference]: Finished difference. Result has 203 places, 195 transitions, 2466 flow [2024-06-03 22:25:31,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2466, PETRI_PLACES=203, PETRI_TRANSITIONS=195} [2024-06-03 22:25:31,418 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-03 22:25:31,418 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 195 transitions, 2466 flow [2024-06-03 22:25:31,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:31,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:31,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:31,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-03 22:25:31,419 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:31,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 298954043, now seen corresponding path program 10 times [2024-06-03 22:25:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:31,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34438718] [2024-06-03 22:25:31,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:38,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:38,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34438718] [2024-06-03 22:25:38,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34438718] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:38,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:38,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656681808] [2024-06-03 22:25:38,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:38,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:38,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:38,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:38,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:38,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 195 transitions, 2466 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:38,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:38,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:38,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:38,934 INFO L124 PetriNetUnfolderBase]: 552/1006 cut-off events. [2024-06-03 22:25:38,934 INFO L125 PetriNetUnfolderBase]: For 43618/43618 co-relation queries the response was YES. [2024-06-03 22:25:38,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7193 conditions, 1006 events. 552/1006 cut-off events. For 43618/43618 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5136 event pairs, 102 based on Foata normal form. 2/1008 useless extension candidates. Maximal degree in co-relation 7100. Up to 803 conditions per place. [2024-06-03 22:25:38,941 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 66 changer transitions 0/214 dead transitions. [2024-06-03 22:25:38,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 214 transitions, 2960 flow [2024-06-03 22:25:38,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:38,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:38,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 22:25:38,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 22:25:38,945 INFO L175 Difference]: Start difference. First operand has 203 places, 195 transitions, 2466 flow. Second operand 10 states and 119 transitions. [2024-06-03 22:25:38,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 214 transitions, 2960 flow [2024-06-03 22:25:39,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 214 transitions, 2822 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:39,033 INFO L231 Difference]: Finished difference. Result has 205 places, 195 transitions, 2464 flow [2024-06-03 22:25:39,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2464, PETRI_PLACES=205, PETRI_TRANSITIONS=195} [2024-06-03 22:25:39,034 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 175 predicate places. [2024-06-03 22:25:39,034 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 195 transitions, 2464 flow [2024-06-03 22:25:39,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:39,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:39,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:39,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-03 22:25:39,035 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:39,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1169329133, now seen corresponding path program 11 times [2024-06-03 22:25:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132890967] [2024-06-03 22:25:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:39,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:45,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:45,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132890967] [2024-06-03 22:25:45,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132890967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:45,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:45,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589047701] [2024-06-03 22:25:45,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:45,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:45,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:46,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:46,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 195 transitions, 2464 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:46,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:46,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:46,559 INFO L124 PetriNetUnfolderBase]: 561/1025 cut-off events. [2024-06-03 22:25:46,559 INFO L125 PetriNetUnfolderBase]: For 45249/45249 co-relation queries the response was YES. [2024-06-03 22:25:46,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7303 conditions, 1025 events. 561/1025 cut-off events. For 45249/45249 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5263 event pairs, 107 based on Foata normal form. 2/1027 useless extension candidates. Maximal degree in co-relation 7209. Up to 748 conditions per place. [2024-06-03 22:25:46,567 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 176 selfloop transitions, 48 changer transitions 0/226 dead transitions. [2024-06-03 22:25:46,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 226 transitions, 3173 flow [2024-06-03 22:25:46,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:46,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-06-03 22:25:46,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2024-06-03 22:25:46,569 INFO L175 Difference]: Start difference. First operand has 205 places, 195 transitions, 2464 flow. Second operand 10 states and 137 transitions. [2024-06-03 22:25:46,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 226 transitions, 3173 flow [2024-06-03 22:25:46,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 226 transitions, 3037 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-03 22:25:46,674 INFO L231 Difference]: Finished difference. Result has 207 places, 197 transitions, 2470 flow [2024-06-03 22:25:46,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2470, PETRI_PLACES=207, PETRI_TRANSITIONS=197} [2024-06-03 22:25:46,674 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 177 predicate places. [2024-06-03 22:25:46,674 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 197 transitions, 2470 flow [2024-06-03 22:25:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:46,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:46,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:46,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-03 22:25:46,675 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:46,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1013205658, now seen corresponding path program 5 times [2024-06-03 22:25:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:46,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762427069] [2024-06-03 22:25:46,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:46,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:52,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:52,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762427069] [2024-06-03 22:25:52,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762427069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:52,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:52,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:52,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477305121] [2024-06-03 22:25:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:52,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:52,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:52,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:52,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:52,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:52,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 197 transitions, 2470 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:52,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:52,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:52,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:52,926 INFO L124 PetriNetUnfolderBase]: 567/1035 cut-off events. [2024-06-03 22:25:52,926 INFO L125 PetriNetUnfolderBase]: For 47072/47072 co-relation queries the response was YES. [2024-06-03 22:25:52,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7398 conditions, 1035 events. 567/1035 cut-off events. For 47072/47072 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5340 event pairs, 111 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 7302. Up to 789 conditions per place. [2024-06-03 22:25:52,935 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 58 changer transitions 0/220 dead transitions. [2024-06-03 22:25:52,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 220 transitions, 3116 flow [2024-06-03 22:25:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:52,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:52,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2024-06-03 22:25:52,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290322580645161 [2024-06-03 22:25:52,936 INFO L175 Difference]: Start difference. First operand has 207 places, 197 transitions, 2470 flow. Second operand 10 states and 133 transitions. [2024-06-03 22:25:52,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 220 transitions, 3116 flow [2024-06-03 22:25:53,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 220 transitions, 2998 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:53,049 INFO L231 Difference]: Finished difference. Result has 209 places, 199 transitions, 2505 flow [2024-06-03 22:25:53,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2505, PETRI_PLACES=209, PETRI_TRANSITIONS=199} [2024-06-03 22:25:53,049 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 179 predicate places. [2024-06-03 22:25:53,049 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 199 transitions, 2505 flow [2024-06-03 22:25:53,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:53,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:53,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:53,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-03 22:25:53,050 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:53,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:53,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1169332853, now seen corresponding path program 12 times [2024-06-03 22:25:53,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:53,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647011134] [2024-06-03 22:25:53,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:53,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:25:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:25:59,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:25:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647011134] [2024-06-03 22:25:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647011134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:25:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:25:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:25:59,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109738093] [2024-06-03 22:25:59,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:25:59,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:25:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:25:59,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:25:59,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:25:59,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:25:59,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 199 transitions, 2505 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:59,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:25:59,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:25:59,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:25:59,786 INFO L124 PetriNetUnfolderBase]: 571/1043 cut-off events. [2024-06-03 22:25:59,787 INFO L125 PetriNetUnfolderBase]: For 49003/49003 co-relation queries the response was YES. [2024-06-03 22:25:59,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7467 conditions, 1043 events. 571/1043 cut-off events. For 49003/49003 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5382 event pairs, 113 based on Foata normal form. 2/1045 useless extension candidates. Maximal degree in co-relation 7370. Up to 868 conditions per place. [2024-06-03 22:25:59,796 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 174 selfloop transitions, 46 changer transitions 0/222 dead transitions. [2024-06-03 22:25:59,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 3049 flow [2024-06-03 22:25:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:25:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:25:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:25:59,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 22:25:59,797 INFO L175 Difference]: Start difference. First operand has 209 places, 199 transitions, 2505 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:25:59,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 3049 flow [2024-06-03 22:25:59,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 222 transitions, 2898 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-03 22:25:59,901 INFO L231 Difference]: Finished difference. Result has 211 places, 200 transitions, 2470 flow [2024-06-03 22:25:59,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2354, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2470, PETRI_PLACES=211, PETRI_TRANSITIONS=200} [2024-06-03 22:25:59,901 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 22:25:59,902 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 200 transitions, 2470 flow [2024-06-03 22:25:59,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:25:59,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:25:59,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:25:59,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-03 22:25:59,902 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:25:59,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:25:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1169477003, now seen corresponding path program 13 times [2024-06-03 22:25:59,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:25:59,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943687909] [2024-06-03 22:25:59,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:25:59,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:25:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:06,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:06,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943687909] [2024-06-03 22:26:06,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943687909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:06,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:06,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:06,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855894509] [2024-06-03 22:26:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:06,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:06,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:06,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:06,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:06,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:06,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 200 transitions, 2470 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:06,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:06,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:06,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:06,984 INFO L124 PetriNetUnfolderBase]: 591/1087 cut-off events. [2024-06-03 22:26:06,985 INFO L125 PetriNetUnfolderBase]: For 63906/63906 co-relation queries the response was YES. [2024-06-03 22:26:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7630 conditions, 1087 events. 591/1087 cut-off events. For 63906/63906 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5696 event pairs, 113 based on Foata normal form. 12/1099 useless extension candidates. Maximal degree in co-relation 7532. Up to 892 conditions per place. [2024-06-03 22:26:06,994 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 183 selfloop transitions, 35 changer transitions 8/228 dead transitions. [2024-06-03 22:26:06,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 228 transitions, 3078 flow [2024-06-03 22:26:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-03 22:26:06,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258064516129032 [2024-06-03 22:26:06,995 INFO L175 Difference]: Start difference. First operand has 211 places, 200 transitions, 2470 flow. Second operand 10 states and 132 transitions. [2024-06-03 22:26:06,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 228 transitions, 3078 flow [2024-06-03 22:26:07,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 228 transitions, 2976 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:07,107 INFO L231 Difference]: Finished difference. Result has 213 places, 198 transitions, 2415 flow [2024-06-03 22:26:07,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2368, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2415, PETRI_PLACES=213, PETRI_TRANSITIONS=198} [2024-06-03 22:26:07,108 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 183 predicate places. [2024-06-03 22:26:07,108 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 198 transitions, 2415 flow [2024-06-03 22:26:07,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:07,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:07,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:07,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-03 22:26:07,108 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:07,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:07,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1174839538, now seen corresponding path program 6 times [2024-06-03 22:26:07,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:07,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721278649] [2024-06-03 22:26:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:07,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:12,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:12,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721278649] [2024-06-03 22:26:12,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721278649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:12,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:12,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:12,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797941036] [2024-06-03 22:26:12,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:12,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:12,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:12,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:12,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:12,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 198 transitions, 2415 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:12,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:12,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:12,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:13,060 INFO L124 PetriNetUnfolderBase]: 571/1048 cut-off events. [2024-06-03 22:26:13,061 INFO L125 PetriNetUnfolderBase]: For 52322/52322 co-relation queries the response was YES. [2024-06-03 22:26:13,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7437 conditions, 1048 events. 571/1048 cut-off events. For 52322/52322 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5427 event pairs, 109 based on Foata normal form. 2/1050 useless extension candidates. Maximal degree in co-relation 7338. Up to 834 conditions per place. [2024-06-03 22:26:13,070 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 169 selfloop transitions, 50 changer transitions 0/221 dead transitions. [2024-06-03 22:26:13,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 221 transitions, 2969 flow [2024-06-03 22:26:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-03 22:26:13,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-03 22:26:13,071 INFO L175 Difference]: Start difference. First operand has 213 places, 198 transitions, 2415 flow. Second operand 11 states and 139 transitions. [2024-06-03 22:26:13,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 221 transitions, 2969 flow [2024-06-03 22:26:13,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 221 transitions, 2887 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:13,193 INFO L231 Difference]: Finished difference. Result has 216 places, 200 transitions, 2474 flow [2024-06-03 22:26:13,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2474, PETRI_PLACES=216, PETRI_TRANSITIONS=200} [2024-06-03 22:26:13,193 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 186 predicate places. [2024-06-03 22:26:13,193 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 200 transitions, 2474 flow [2024-06-03 22:26:13,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:13,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:13,194 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:13,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-03 22:26:13,194 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:13,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:13,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1418827828, now seen corresponding path program 7 times [2024-06-03 22:26:13,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:13,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041924641] [2024-06-03 22:26:13,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:13,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:18,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:18,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041924641] [2024-06-03 22:26:18,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041924641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:18,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618395690] [2024-06-03 22:26:18,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:18,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:18,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:18,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:18,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:18,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:18,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 200 transitions, 2474 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:18,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:18,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:18,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:19,313 INFO L124 PetriNetUnfolderBase]: 567/1041 cut-off events. [2024-06-03 22:26:19,313 INFO L125 PetriNetUnfolderBase]: For 51089/51089 co-relation queries the response was YES. [2024-06-03 22:26:19,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7343 conditions, 1041 events. 567/1041 cut-off events. For 51089/51089 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5428 event pairs, 110 based on Foata normal form. 2/1043 useless extension candidates. Maximal degree in co-relation 7243. Up to 836 conditions per place. [2024-06-03 22:26:19,323 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 171 selfloop transitions, 47 changer transitions 0/220 dead transitions. [2024-06-03 22:26:19,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 2990 flow [2024-06-03 22:26:19,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2024-06-03 22:26:19,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161290322580645 [2024-06-03 22:26:19,324 INFO L175 Difference]: Start difference. First operand has 216 places, 200 transitions, 2474 flow. Second operand 10 states and 129 transitions. [2024-06-03 22:26:19,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 2990 flow [2024-06-03 22:26:19,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 220 transitions, 2855 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:19,435 INFO L231 Difference]: Finished difference. Result has 217 places, 200 transitions, 2438 flow [2024-06-03 22:26:19,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2438, PETRI_PLACES=217, PETRI_TRANSITIONS=200} [2024-06-03 22:26:19,437 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2024-06-03 22:26:19,437 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 200 transitions, 2438 flow [2024-06-03 22:26:19,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:19,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:19,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:19,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-03 22:26:19,438 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:19,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1174839383, now seen corresponding path program 14 times [2024-06-03 22:26:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288509021] [2024-06-03 22:26:19,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:26,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288509021] [2024-06-03 22:26:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288509021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568133956] [2024-06-03 22:26:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:26,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:26,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:26,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:26,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:26,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 200 transitions, 2438 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:26,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:26,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:26,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:27,219 INFO L124 PetriNetUnfolderBase]: 551/1014 cut-off events. [2024-06-03 22:26:27,220 INFO L125 PetriNetUnfolderBase]: For 49714/49714 co-relation queries the response was YES. [2024-06-03 22:26:27,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6552 conditions, 1014 events. 551/1014 cut-off events. For 49714/49714 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5288 event pairs, 96 based on Foata normal form. 12/1026 useless extension candidates. Maximal degree in co-relation 6451. Up to 818 conditions per place. [2024-06-03 22:26:27,244 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 35 changer transitions 8/227 dead transitions. [2024-06-03 22:26:27,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 227 transitions, 3022 flow [2024-06-03 22:26:27,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:26:27,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:26:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2024-06-03 22:26:27,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41055718475073316 [2024-06-03 22:26:27,245 INFO L175 Difference]: Start difference. First operand has 217 places, 200 transitions, 2438 flow. Second operand 11 states and 140 transitions. [2024-06-03 22:26:27,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 227 transitions, 3022 flow [2024-06-03 22:26:27,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 227 transitions, 2890 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:27,350 INFO L231 Difference]: Finished difference. Result has 219 places, 197 transitions, 2333 flow [2024-06-03 22:26:27,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2306, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2333, PETRI_PLACES=219, PETRI_TRANSITIONS=197} [2024-06-03 22:26:27,350 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-03 22:26:27,350 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 197 transitions, 2333 flow [2024-06-03 22:26:27,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:27,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:27,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:27,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-03 22:26:27,351 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:27,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2035713332, now seen corresponding path program 1 times [2024-06-03 22:26:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390438583] [2024-06-03 22:26:27,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:27,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:27,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:33,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390438583] [2024-06-03 22:26:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390438583] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:26:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425183581] [2024-06-03 22:26:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:26:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:26:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:26:33,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:33,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 197 transitions, 2333 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:33,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:33,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:33,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:34,142 INFO L124 PetriNetUnfolderBase]: 533/979 cut-off events. [2024-06-03 22:26:34,142 INFO L125 PetriNetUnfolderBase]: For 38572/38572 co-relation queries the response was YES. [2024-06-03 22:26:34,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 979 events. 533/979 cut-off events. For 38572/38572 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5121 event pairs, 98 based on Foata normal form. 4/983 useless extension candidates. Maximal degree in co-relation 6208. Up to 754 conditions per place. [2024-06-03 22:26:34,151 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 164 selfloop transitions, 52 changer transitions 0/218 dead transitions. [2024-06-03 22:26:34,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 218 transitions, 2865 flow [2024-06-03 22:26:34,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:26:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:26:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:26:34,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:26:34,160 INFO L175 Difference]: Start difference. First operand has 219 places, 197 transitions, 2333 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:26:34,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 218 transitions, 2865 flow [2024-06-03 22:26:34,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 218 transitions, 2714 flow, removed 5 selfloop flow, removed 11 redundant places. [2024-06-03 22:26:34,273 INFO L231 Difference]: Finished difference. Result has 219 places, 201 transitions, 2345 flow [2024-06-03 22:26:34,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2185, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2345, PETRI_PLACES=219, PETRI_TRANSITIONS=201} [2024-06-03 22:26:34,273 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 189 predicate places. [2024-06-03 22:26:34,273 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 201 transitions, 2345 flow [2024-06-03 22:26:34,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:34,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:34,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:34,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-03 22:26:34,274 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:34,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:34,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1191399647, now seen corresponding path program 15 times [2024-06-03 22:26:34,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271746850] [2024-06-03 22:26:34,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:39,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:39,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271746850] [2024-06-03 22:26:39,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271746850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:39,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511781477] [2024-06-03 22:26:39,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:39,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:39,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:39,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:39,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 201 transitions, 2345 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:39,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:39,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:39,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:40,386 INFO L124 PetriNetUnfolderBase]: 566/1046 cut-off events. [2024-06-03 22:26:40,387 INFO L125 PetriNetUnfolderBase]: For 52534/52534 co-relation queries the response was YES. [2024-06-03 22:26:40,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7055 conditions, 1046 events. 566/1046 cut-off events. For 52534/52534 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5488 event pairs, 72 based on Foata normal form. 2/1048 useless extension candidates. Maximal degree in co-relation 6953. Up to 358 conditions per place. [2024-06-03 22:26:40,396 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 112 selfloop transitions, 110 changer transitions 0/224 dead transitions. [2024-06-03 22:26:40,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 224 transitions, 3002 flow [2024-06-03 22:26:40,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:40,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:26:40,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:26:40,397 INFO L175 Difference]: Start difference. First operand has 219 places, 201 transitions, 2345 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:26:40,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 224 transitions, 3002 flow [2024-06-03 22:26:40,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 224 transitions, 2883 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-03 22:26:40,509 INFO L231 Difference]: Finished difference. Result has 221 places, 202 transitions, 2465 flow [2024-06-03 22:26:40,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2226, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2465, PETRI_PLACES=221, PETRI_TRANSITIONS=202} [2024-06-03 22:26:40,510 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 191 predicate places. [2024-06-03 22:26:40,510 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 202 transitions, 2465 flow [2024-06-03 22:26:40,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:40,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:40,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:40,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-03 22:26:40,511 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:40,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:40,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1866543683, now seen corresponding path program 16 times [2024-06-03 22:26:40,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:40,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258814345] [2024-06-03 22:26:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:40,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:46,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-03 22:26:46,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:46,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258814345] [2024-06-03 22:26:46,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258814345] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:46,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:46,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:46,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853753619] [2024-06-03 22:26:46,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:46,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:46,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:46,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:46,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 202 transitions, 2465 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:46,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:46,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:46,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:46,734 INFO L124 PetriNetUnfolderBase]: 580/1070 cut-off events. [2024-06-03 22:26:46,734 INFO L125 PetriNetUnfolderBase]: For 57906/57906 co-relation queries the response was YES. [2024-06-03 22:26:46,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7492 conditions, 1070 events. 580/1070 cut-off events. For 57906/57906 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5625 event pairs, 103 based on Foata normal form. 2/1072 useless extension candidates. Maximal degree in co-relation 7389. Up to 699 conditions per place. [2024-06-03 22:26:46,743 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 118 selfloop transitions, 102 changer transitions 0/222 dead transitions. [2024-06-03 22:26:46,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 222 transitions, 3116 flow [2024-06-03 22:26:46,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:26:46,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-03 22:26:46,745 INFO L175 Difference]: Start difference. First operand has 221 places, 202 transitions, 2465 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:26:46,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 222 transitions, 3116 flow [2024-06-03 22:26:46,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 222 transitions, 2934 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:46,883 INFO L231 Difference]: Finished difference. Result has 222 places, 205 transitions, 2617 flow [2024-06-03 22:26:46,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2617, PETRI_PLACES=222, PETRI_TRANSITIONS=205} [2024-06-03 22:26:46,884 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 192 predicate places. [2024-06-03 22:26:46,884 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 205 transitions, 2617 flow [2024-06-03 22:26:46,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:46,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:46,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:46,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-03 22:26:46,884 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:46,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:46,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1189525697, now seen corresponding path program 17 times [2024-06-03 22:26:46,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:46,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271372549] [2024-06-03 22:26:46,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:46,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271372549] [2024-06-03 22:26:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271372549] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78868841] [2024-06-03 22:26:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:52,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:52,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 205 transitions, 2617 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:52,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:52,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:52,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:52,899 INFO L124 PetriNetUnfolderBase]: 584/1078 cut-off events. [2024-06-03 22:26:52,899 INFO L125 PetriNetUnfolderBase]: For 55131/55131 co-relation queries the response was YES. [2024-06-03 22:26:52,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7658 conditions, 1078 events. 584/1078 cut-off events. For 55131/55131 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 5714 event pairs, 97 based on Foata normal form. 2/1080 useless extension candidates. Maximal degree in co-relation 7556. Up to 665 conditions per place. [2024-06-03 22:26:52,909 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 117 selfloop transitions, 105 changer transitions 0/224 dead transitions. [2024-06-03 22:26:52,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 224 transitions, 3239 flow [2024-06-03 22:26:52,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-03 22:26:52,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:26:52,927 INFO L175 Difference]: Start difference. First operand has 222 places, 205 transitions, 2617 flow. Second operand 9 states and 117 transitions. [2024-06-03 22:26:52,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 224 transitions, 3239 flow [2024-06-03 22:26:53,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 3086 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:26:53,083 INFO L231 Difference]: Finished difference. Result has 223 places, 206 transitions, 2700 flow [2024-06-03 22:26:53,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2468, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2700, PETRI_PLACES=223, PETRI_TRANSITIONS=206} [2024-06-03 22:26:53,084 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-03 22:26:53,084 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 206 transitions, 2700 flow [2024-06-03 22:26:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:53,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:53,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:53,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-03 22:26:53,085 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:53,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1189521822, now seen corresponding path program 8 times [2024-06-03 22:26:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642016947] [2024-06-03 22:26:53,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:53,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:26:59,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:26:59,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:26:59,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642016947] [2024-06-03 22:26:59,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642016947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:26:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:26:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:26:59,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582768920] [2024-06-03 22:26:59,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:26:59,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:26:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:26:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:26:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:26:59,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:26:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 206 transitions, 2700 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:26:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:26:59,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:26:59,789 INFO L124 PetriNetUnfolderBase]: 595/1096 cut-off events. [2024-06-03 22:26:59,789 INFO L125 PetriNetUnfolderBase]: For 54945/54945 co-relation queries the response was YES. [2024-06-03 22:26:59,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7854 conditions, 1096 events. 595/1096 cut-off events. For 54945/54945 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 5791 event pairs, 102 based on Foata normal form. 2/1098 useless extension candidates. Maximal degree in co-relation 7753. Up to 702 conditions per place. [2024-06-03 22:26:59,799 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 126 selfloop transitions, 98 changer transitions 0/226 dead transitions. [2024-06-03 22:26:59,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 226 transitions, 3372 flow [2024-06-03 22:26:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:26:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:26:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-03 22:26:59,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121863799283154 [2024-06-03 22:26:59,801 INFO L175 Difference]: Start difference. First operand has 223 places, 206 transitions, 2700 flow. Second operand 9 states and 115 transitions. [2024-06-03 22:26:59,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 226 transitions, 3372 flow [2024-06-03 22:26:59,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 226 transitions, 3152 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:26:59,949 INFO L231 Difference]: Finished difference. Result has 223 places, 210 transitions, 2759 flow [2024-06-03 22:26:59,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2484, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2759, PETRI_PLACES=223, PETRI_TRANSITIONS=210} [2024-06-03 22:26:59,950 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 193 predicate places. [2024-06-03 22:26:59,950 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 210 transitions, 2759 flow [2024-06-03 22:26:59,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:26:59,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:26:59,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:26:59,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-03 22:26:59,951 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:26:59,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:26:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1102685862, now seen corresponding path program 9 times [2024-06-03 22:26:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:26:59,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033095844] [2024-06-03 22:26:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:26:59,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:26:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:04,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:04,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033095844] [2024-06-03 22:27:04,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033095844] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:04,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:04,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655494498] [2024-06-03 22:27:04,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:04,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:04,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:04,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:05,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:27:05,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 210 transitions, 2759 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:05,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:05,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:27:05,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:05,432 INFO L124 PetriNetUnfolderBase]: 601/1106 cut-off events. [2024-06-03 22:27:05,432 INFO L125 PetriNetUnfolderBase]: For 53423/53423 co-relation queries the response was YES. [2024-06-03 22:27:05,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 1106 events. 601/1106 cut-off events. For 53423/53423 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5853 event pairs, 108 based on Foata normal form. 2/1108 useless extension candidates. Maximal degree in co-relation 7820. Up to 884 conditions per place. [2024-06-03 22:27:05,441 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 167 selfloop transitions, 58 changer transitions 0/227 dead transitions. [2024-06-03 22:27:05,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 227 transitions, 3305 flow [2024-06-03 22:27:05,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 122 transitions. [2024-06-03 22:27:05,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43727598566308246 [2024-06-03 22:27:05,443 INFO L175 Difference]: Start difference. First operand has 223 places, 210 transitions, 2759 flow. Second operand 9 states and 122 transitions. [2024-06-03 22:27:05,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 227 transitions, 3305 flow [2024-06-03 22:27:05,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 3212 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-03 22:27:05,573 INFO L231 Difference]: Finished difference. Result has 226 places, 212 transitions, 2830 flow [2024-06-03 22:27:05,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2830, PETRI_PLACES=226, PETRI_TRANSITIONS=212} [2024-06-03 22:27:05,574 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 196 predicate places. [2024-06-03 22:27:05,574 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 212 transitions, 2830 flow [2024-06-03 22:27:05,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:05,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:05,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:05,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-03 22:27:05,575 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:05,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:05,575 INFO L85 PathProgramCache]: Analyzing trace with hash -616991441, now seen corresponding path program 18 times [2024-06-03 22:27:05,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:05,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118728104] [2024-06-03 22:27:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:10,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:10,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118728104] [2024-06-03 22:27:10,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118728104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:10,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:10,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:10,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879902083] [2024-06-03 22:27:10,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:10,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:10,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:10,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:10,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:10,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:10,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 212 transitions, 2830 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:10,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:10,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:10,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:11,253 INFO L124 PetriNetUnfolderBase]: 621/1150 cut-off events. [2024-06-03 22:27:11,253 INFO L125 PetriNetUnfolderBase]: For 67891/67891 co-relation queries the response was YES. [2024-06-03 22:27:11,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8205 conditions, 1150 events. 621/1150 cut-off events. For 67891/67891 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6141 event pairs, 112 based on Foata normal form. 12/1162 useless extension candidates. Maximal degree in co-relation 8104. Up to 886 conditions per place. [2024-06-03 22:27:11,263 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 169 selfloop transitions, 53 changer transitions 8/232 dead transitions. [2024-06-03 22:27:11,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 232 transitions, 3404 flow [2024-06-03 22:27:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:11,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-03 22:27:11,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4157706093189964 [2024-06-03 22:27:11,272 INFO L175 Difference]: Start difference. First operand has 226 places, 212 transitions, 2830 flow. Second operand 9 states and 116 transitions. [2024-06-03 22:27:11,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 232 transitions, 3404 flow [2024-06-03 22:27:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 232 transitions, 3269 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:11,423 INFO L231 Difference]: Finished difference. Result has 227 places, 210 transitions, 2784 flow [2024-06-03 22:27:11,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2695, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2784, PETRI_PLACES=227, PETRI_TRANSITIONS=210} [2024-06-03 22:27:11,423 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 197 predicate places. [2024-06-03 22:27:11,424 INFO L495 AbstractCegarLoop]: Abstraction has has 227 places, 210 transitions, 2784 flow [2024-06-03 22:27:11,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:11,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:11,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:11,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-03 22:27:11,424 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:11,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1102830167, now seen corresponding path program 19 times [2024-06-03 22:27:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946442327] [2024-06-03 22:27:11,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:16,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:16,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946442327] [2024-06-03 22:27:16,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946442327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:16,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:16,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:16,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055923860] [2024-06-03 22:27:16,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:16,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:16,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:16,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:16,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:16,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:16,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 210 transitions, 2784 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:16,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:16,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:16,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:17,277 INFO L124 PetriNetUnfolderBase]: 599/1108 cut-off events. [2024-06-03 22:27:17,277 INFO L125 PetriNetUnfolderBase]: For 53243/53243 co-relation queries the response was YES. [2024-06-03 22:27:17,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7971 conditions, 1108 events. 599/1108 cut-off events. For 53243/53243 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 5913 event pairs, 110 based on Foata normal form. 2/1110 useless extension candidates. Maximal degree in co-relation 7870. Up to 882 conditions per place. [2024-06-03 22:27:17,286 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 164 selfloop transitions, 59 changer transitions 0/225 dead transitions. [2024-06-03 22:27:17,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 225 transitions, 3296 flow [2024-06-03 22:27:17,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:17,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:17,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 22:27:17,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 22:27:17,288 INFO L175 Difference]: Start difference. First operand has 227 places, 210 transitions, 2784 flow. Second operand 9 states and 111 transitions. [2024-06-03 22:27:17,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 225 transitions, 3296 flow [2024-06-03 22:27:17,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 3182 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:17,430 INFO L231 Difference]: Finished difference. Result has 228 places, 211 transitions, 2812 flow [2024-06-03 22:27:17,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2670, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2812, PETRI_PLACES=228, PETRI_TRANSITIONS=211} [2024-06-03 22:27:17,430 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2024-06-03 22:27:17,430 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 211 transitions, 2812 flow [2024-06-03 22:27:17,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:17,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:17,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:17,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-03 22:27:17,431 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:17,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:17,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1102830012, now seen corresponding path program 10 times [2024-06-03 22:27:17,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:17,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129483122] [2024-06-03 22:27:17,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:17,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129483122] [2024-06-03 22:27:22,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129483122] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:22,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:22,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:22,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834517519] [2024-06-03 22:27:22,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:22,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:22,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:22,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:23,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:23,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 211 transitions, 2812 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:23,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:23,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:23,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:23,442 INFO L124 PetriNetUnfolderBase]: 605/1118 cut-off events. [2024-06-03 22:27:23,442 INFO L125 PetriNetUnfolderBase]: For 53465/53465 co-relation queries the response was YES. [2024-06-03 22:27:23,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8049 conditions, 1118 events. 605/1118 cut-off events. For 53465/53465 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5960 event pairs, 110 based on Foata normal form. 2/1120 useless extension candidates. Maximal degree in co-relation 7948. Up to 880 conditions per place. [2024-06-03 22:27:23,453 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 163 selfloop transitions, 63 changer transitions 0/228 dead transitions. [2024-06-03 22:27:23,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 228 transitions, 3360 flow [2024-06-03 22:27:23,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-03 22:27:23,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40860215053763443 [2024-06-03 22:27:23,455 INFO L175 Difference]: Start difference. First operand has 228 places, 211 transitions, 2812 flow. Second operand 9 states and 114 transitions. [2024-06-03 22:27:23,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 228 transitions, 3360 flow [2024-06-03 22:27:23,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 228 transitions, 3232 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:23,590 INFO L231 Difference]: Finished difference. Result has 229 places, 213 transitions, 2858 flow [2024-06-03 22:27:23,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2684, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2858, PETRI_PLACES=229, PETRI_TRANSITIONS=213} [2024-06-03 22:27:23,590 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-03 22:27:23,590 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 213 transitions, 2858 flow [2024-06-03 22:27:23,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:23,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:23,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:23,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-03 22:27:23,591 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:23,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1102833887, now seen corresponding path program 20 times [2024-06-03 22:27:23,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625303965] [2024-06-03 22:27:23,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:29,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:29,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625303965] [2024-06-03 22:27:29,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625303965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:29,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:29,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:29,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378404543] [2024-06-03 22:27:29,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:29,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:29,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:29,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:29,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:29,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:29,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 213 transitions, 2858 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:29,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:29,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:29,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:29,740 INFO L124 PetriNetUnfolderBase]: 609/1126 cut-off events. [2024-06-03 22:27:29,740 INFO L125 PetriNetUnfolderBase]: For 53591/53591 co-relation queries the response was YES. [2024-06-03 22:27:29,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8106 conditions, 1126 events. 609/1126 cut-off events. For 53591/53591 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6020 event pairs, 109 based on Foata normal form. 2/1128 useless extension candidates. Maximal degree in co-relation 8005. Up to 843 conditions per place. [2024-06-03 22:27:29,750 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 160 selfloop transitions, 68 changer transitions 0/230 dead transitions. [2024-06-03 22:27:29,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 3390 flow [2024-06-03 22:27:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-03 22:27:29,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050179211469534 [2024-06-03 22:27:29,752 INFO L175 Difference]: Start difference. First operand has 229 places, 213 transitions, 2858 flow. Second operand 9 states and 113 transitions. [2024-06-03 22:27:29,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 3390 flow [2024-06-03 22:27:29,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 230 transitions, 3241 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:29,899 INFO L231 Difference]: Finished difference. Result has 230 places, 214 transitions, 2871 flow [2024-06-03 22:27:29,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2871, PETRI_PLACES=230, PETRI_TRANSITIONS=214} [2024-06-03 22:27:29,900 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-03 22:27:29,900 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 214 transitions, 2871 flow [2024-06-03 22:27:29,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:29,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:29,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:29,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-03 22:27:29,900 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:29,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:29,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1794170677, now seen corresponding path program 21 times [2024-06-03 22:27:29,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:29,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28616381] [2024-06-03 22:27:29,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:29,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:35,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:35,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28616381] [2024-06-03 22:27:35,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28616381] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:35,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:35,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:35,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957385114] [2024-06-03 22:27:35,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:35,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:35,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:35,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:35,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:35,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:35,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 214 transitions, 2871 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:35,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:35,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:35,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:36,006 INFO L124 PetriNetUnfolderBase]: 613/1134 cut-off events. [2024-06-03 22:27:36,007 INFO L125 PetriNetUnfolderBase]: For 53525/53525 co-relation queries the response was YES. [2024-06-03 22:27:36,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1134 events. 613/1134 cut-off events. For 53525/53525 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6067 event pairs, 58 based on Foata normal form. 2/1136 useless extension candidates. Maximal degree in co-relation 8047. Up to 654 conditions per place. [2024-06-03 22:27:36,015 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 146 selfloop transitions, 93 changer transitions 0/241 dead transitions. [2024-06-03 22:27:36,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 241 transitions, 3604 flow [2024-06-03 22:27:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 126 transitions. [2024-06-03 22:27:36,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-06-03 22:27:36,017 INFO L175 Difference]: Start difference. First operand has 230 places, 214 transitions, 2871 flow. Second operand 9 states and 126 transitions. [2024-06-03 22:27:36,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 241 transitions, 3604 flow [2024-06-03 22:27:36,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 241 transitions, 3454 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:36,147 INFO L231 Difference]: Finished difference. Result has 231 places, 215 transitions, 2935 flow [2024-06-03 22:27:36,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2723, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2935, PETRI_PLACES=231, PETRI_TRANSITIONS=215} [2024-06-03 22:27:36,147 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2024-06-03 22:27:36,147 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 215 transitions, 2935 flow [2024-06-03 22:27:36,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:36,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:36,148 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:36,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-03 22:27:36,149 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:36,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771038, now seen corresponding path program 11 times [2024-06-03 22:27:36,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:36,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591100383] [2024-06-03 22:27:36,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:41,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591100383] [2024-06-03 22:27:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591100383] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814605502] [2024-06-03 22:27:41,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:41,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:41,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:27:41,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 215 transitions, 2935 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:41,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:41,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:27:41,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:42,005 INFO L124 PetriNetUnfolderBase]: 619/1144 cut-off events. [2024-06-03 22:27:42,005 INFO L125 PetriNetUnfolderBase]: For 53584/53584 co-relation queries the response was YES. [2024-06-03 22:27:42,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8306 conditions, 1144 events. 619/1144 cut-off events. For 53584/53584 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6159 event pairs, 91 based on Foata normal form. 2/1146 useless extension candidates. Maximal degree in co-relation 8205. Up to 798 conditions per place. [2024-06-03 22:27:42,015 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 144 selfloop transitions, 94 changer transitions 0/240 dead transitions. [2024-06-03 22:27:42,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 240 transitions, 3654 flow [2024-06-03 22:27:42,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:42,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-06-03 22:27:42,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2024-06-03 22:27:42,017 INFO L175 Difference]: Start difference. First operand has 231 places, 215 transitions, 2935 flow. Second operand 9 states and 132 transitions. [2024-06-03 22:27:42,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 240 transitions, 3654 flow [2024-06-03 22:27:42,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 240 transitions, 3428 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:42,158 INFO L231 Difference]: Finished difference. Result has 233 places, 218 transitions, 2983 flow [2024-06-03 22:27:42,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2983, PETRI_PLACES=233, PETRI_TRANSITIONS=218} [2024-06-03 22:27:42,158 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-03 22:27:42,158 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 218 transitions, 2983 flow [2024-06-03 22:27:42,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:42,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:42,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:42,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-03 22:27:42,160 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:42,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1823771193, now seen corresponding path program 22 times [2024-06-03 22:27:42,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:42,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484904148] [2024-06-03 22:27:42,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:47,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484904148] [2024-06-03 22:27:47,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484904148] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:47,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:47,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:47,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250314191] [2024-06-03 22:27:47,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:47,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:47,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:47,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:47,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:47,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:47,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 218 transitions, 2983 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:47,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:47,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:47,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:48,116 INFO L124 PetriNetUnfolderBase]: 623/1152 cut-off events. [2024-06-03 22:27:48,116 INFO L125 PetriNetUnfolderBase]: For 53598/53598 co-relation queries the response was YES. [2024-06-03 22:27:48,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8379 conditions, 1152 events. 623/1152 cut-off events. For 53598/53598 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6235 event pairs, 92 based on Foata normal form. 2/1154 useless extension candidates. Maximal degree in co-relation 8277. Up to 861 conditions per place. [2024-06-03 22:27:48,126 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 153 selfloop transitions, 84 changer transitions 0/239 dead transitions. [2024-06-03 22:27:48,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 239 transitions, 3556 flow [2024-06-03 22:27:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:48,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-03 22:27:48,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2024-06-03 22:27:48,128 INFO L175 Difference]: Start difference. First operand has 233 places, 218 transitions, 2983 flow. Second operand 9 states and 120 transitions. [2024-06-03 22:27:48,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 239 transitions, 3556 flow [2024-06-03 22:27:48,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 239 transitions, 3454 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-03 22:27:48,268 INFO L231 Difference]: Finished difference. Result has 237 places, 219 transitions, 3077 flow [2024-06-03 22:27:48,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2881, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3077, PETRI_PLACES=237, PETRI_TRANSITIONS=219} [2024-06-03 22:27:48,269 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2024-06-03 22:27:48,269 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 219 transitions, 3077 flow [2024-06-03 22:27:48,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:48,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:48,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:48,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-03 22:27:48,270 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:48,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1794318702, now seen corresponding path program 12 times [2024-06-03 22:27:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101731006] [2024-06-03 22:27:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:48,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:53,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:53,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101731006] [2024-06-03 22:27:53,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101731006] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:53,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:53,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:27:53,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416618863] [2024-06-03 22:27:53,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:53,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:27:53,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:27:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:27:53,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:27:53,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 219 transitions, 3077 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:53,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:53,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:27:53,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:53,707 INFO L124 PetriNetUnfolderBase]: 629/1164 cut-off events. [2024-06-03 22:27:53,707 INFO L125 PetriNetUnfolderBase]: For 54203/54203 co-relation queries the response was YES. [2024-06-03 22:27:53,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8499 conditions, 1164 events. 629/1164 cut-off events. For 54203/54203 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 6330 event pairs, 112 based on Foata normal form. 2/1166 useless extension candidates. Maximal degree in co-relation 8397. Up to 940 conditions per place. [2024-06-03 22:27:53,718 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 180 selfloop transitions, 60 changer transitions 0/242 dead transitions. [2024-06-03 22:27:53,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 242 transitions, 3703 flow [2024-06-03 22:27:53,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:53,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 127 transitions. [2024-06-03 22:27:53,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4551971326164875 [2024-06-03 22:27:53,719 INFO L175 Difference]: Start difference. First operand has 237 places, 219 transitions, 3077 flow. Second operand 9 states and 127 transitions. [2024-06-03 22:27:53,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 242 transitions, 3703 flow [2024-06-03 22:27:53,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 242 transitions, 3521 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:53,864 INFO L231 Difference]: Finished difference. Result has 238 places, 221 transitions, 3069 flow [2024-06-03 22:27:53,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2895, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3069, PETRI_PLACES=238, PETRI_TRANSITIONS=221} [2024-06-03 22:27:53,865 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-03 22:27:53,865 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 221 transitions, 3069 flow [2024-06-03 22:27:53,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:53,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:53,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:53,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-03 22:27:53,866 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:53,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:53,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1799896408, now seen corresponding path program 2 times [2024-06-03 22:27:53,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:53,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360892634] [2024-06-03 22:27:53,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:53,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:27:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:27:58,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:27:58,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360892634] [2024-06-03 22:27:58,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360892634] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:27:58,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:27:58,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:27:58,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694258575] [2024-06-03 22:27:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:27:58,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:27:58,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:27:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:27:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:27:58,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:27:58,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 221 transitions, 3069 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:58,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:27:58,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:27:58,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:27:59,391 INFO L124 PetriNetUnfolderBase]: 637/1179 cut-off events. [2024-06-03 22:27:59,391 INFO L125 PetriNetUnfolderBase]: For 57620/57620 co-relation queries the response was YES. [2024-06-03 22:27:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8503 conditions, 1179 events. 637/1179 cut-off events. For 57620/57620 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6416 event pairs, 113 based on Foata normal form. 4/1183 useless extension candidates. Maximal degree in co-relation 8401. Up to 941 conditions per place. [2024-06-03 22:27:59,402 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 177 selfloop transitions, 59 changer transitions 0/238 dead transitions. [2024-06-03 22:27:59,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 238 transitions, 3630 flow [2024-06-03 22:27:59,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:27:59,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:27:59,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-03 22:27:59,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978494623655914 [2024-06-03 22:27:59,404 INFO L175 Difference]: Start difference. First operand has 238 places, 221 transitions, 3069 flow. Second operand 9 states and 111 transitions. [2024-06-03 22:27:59,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 238 transitions, 3630 flow [2024-06-03 22:27:59,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 238 transitions, 3481 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-03 22:27:59,550 INFO L231 Difference]: Finished difference. Result has 240 places, 225 transitions, 3111 flow [2024-06-03 22:27:59,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2922, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3111, PETRI_PLACES=240, PETRI_TRANSITIONS=225} [2024-06-03 22:27:59,551 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2024-06-03 22:27:59,551 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 225 transitions, 3111 flow [2024-06-03 22:27:59,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:27:59,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:27:59,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:27:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-03 22:27:59,552 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:27:59,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:27:59,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1332570087, now seen corresponding path program 23 times [2024-06-03 22:27:59,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:27:59,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469884823] [2024-06-03 22:27:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:27:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:27:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:04,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469884823] [2024-06-03 22:28:04,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469884823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:04,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273464765] [2024-06-03 22:28:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:04,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:04,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:04,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:04,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:05,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:05,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 225 transitions, 3111 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:05,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:05,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:05,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:05,594 INFO L124 PetriNetUnfolderBase]: 657/1223 cut-off events. [2024-06-03 22:28:05,595 INFO L125 PetriNetUnfolderBase]: For 69320/69320 co-relation queries the response was YES. [2024-06-03 22:28:05,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8706 conditions, 1223 events. 657/1223 cut-off events. For 69320/69320 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6709 event pairs, 113 based on Foata normal form. 12/1235 useless extension candidates. Maximal degree in co-relation 8603. Up to 958 conditions per place. [2024-06-03 22:28:05,605 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 185 selfloop transitions, 53 changer transitions 8/248 dead transitions. [2024-06-03 22:28:05,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 248 transitions, 3744 flow [2024-06-03 22:28:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 22:28:05,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-03 22:28:05,607 INFO L175 Difference]: Start difference. First operand has 240 places, 225 transitions, 3111 flow. Second operand 10 states and 127 transitions. [2024-06-03 22:28:05,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 248 transitions, 3744 flow [2024-06-03 22:28:05,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 248 transitions, 3622 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-03 22:28:05,735 INFO L231 Difference]: Finished difference. Result has 245 places, 223 transitions, 3080 flow [2024-06-03 22:28:05,735 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2989, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3080, PETRI_PLACES=245, PETRI_TRANSITIONS=223} [2024-06-03 22:28:05,735 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-03 22:28:05,735 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 223 transitions, 3080 flow [2024-06-03 22:28:05,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:05,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:05,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:05,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-03 22:28:05,736 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:05,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1794318547, now seen corresponding path program 24 times [2024-06-03 22:28:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:05,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539445901] [2024-06-03 22:28:05,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:05,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:10,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:10,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539445901] [2024-06-03 22:28:10,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539445901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:10,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:10,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:28:10,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254789493] [2024-06-03 22:28:10,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:10,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:28:10,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:10,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:28:10,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:28:10,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:10,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 223 transitions, 3080 flow. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:10,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:10,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:10,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:11,421 INFO L124 PetriNetUnfolderBase]: 651/1216 cut-off events. [2024-06-03 22:28:11,421 INFO L125 PetriNetUnfolderBase]: For 69103/69103 co-relation queries the response was YES. [2024-06-03 22:28:11,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8624 conditions, 1216 events. 651/1216 cut-off events. For 69103/69103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6671 event pairs, 118 based on Foata normal form. 12/1228 useless extension candidates. Maximal degree in co-relation 8520. Up to 952 conditions per place. [2024-06-03 22:28:11,432 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 55 changer transitions 8/249 dead transitions. [2024-06-03 22:28:11,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 3746 flow [2024-06-03 22:28:11,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-03 22:28:11,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4336917562724014 [2024-06-03 22:28:11,434 INFO L175 Difference]: Start difference. First operand has 245 places, 223 transitions, 3080 flow. Second operand 9 states and 121 transitions. [2024-06-03 22:28:11,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 3746 flow [2024-06-03 22:28:11,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 249 transitions, 3624 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:11,587 INFO L231 Difference]: Finished difference. Result has 245 places, 221 transitions, 3054 flow [2024-06-03 22:28:11,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3054, PETRI_PLACES=245, PETRI_TRANSITIONS=221} [2024-06-03 22:28:11,587 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-03 22:28:11,588 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 221 transitions, 3054 flow [2024-06-03 22:28:11,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:11,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:11,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:11,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-03 22:28:11,588 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:11,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1332569932, now seen corresponding path program 13 times [2024-06-03 22:28:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686761688] [2024-06-03 22:28:11,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:11,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:11,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:16,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:16,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:16,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686761688] [2024-06-03 22:28:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686761688] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108221531] [2024-06-03 22:28:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:16,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:16,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:16,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 221 transitions, 3054 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:16,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:16,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:16,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:17,530 INFO L124 PetriNetUnfolderBase]: 631/1176 cut-off events. [2024-06-03 22:28:17,530 INFO L125 PetriNetUnfolderBase]: For 55114/55114 co-relation queries the response was YES. [2024-06-03 22:28:17,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8450 conditions, 1176 events. 631/1176 cut-off events. For 55114/55114 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6448 event pairs, 206 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 8346. Up to 1039 conditions per place. [2024-06-03 22:28:17,541 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 203 selfloop transitions, 34 changer transitions 0/239 dead transitions. [2024-06-03 22:28:17,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 239 transitions, 3650 flow [2024-06-03 22:28:17,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:28:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:28:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-03 22:28:17,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-03 22:28:17,542 INFO L175 Difference]: Start difference. First operand has 245 places, 221 transitions, 3054 flow. Second operand 11 states and 127 transitions. [2024-06-03 22:28:17,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 239 transitions, 3650 flow [2024-06-03 22:28:17,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 239 transitions, 3520 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:17,673 INFO L231 Difference]: Finished difference. Result has 248 places, 223 transitions, 3049 flow [2024-06-03 22:28:17,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2926, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3049, PETRI_PLACES=248, PETRI_TRANSITIONS=223} [2024-06-03 22:28:17,673 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-03 22:28:17,673 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 223 transitions, 3049 flow [2024-06-03 22:28:17,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:17,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:17,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:17,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-03 22:28:17,674 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:17,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 931544772, now seen corresponding path program 3 times [2024-06-03 22:28:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295182063] [2024-06-03 22:28:17,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:23,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295182063] [2024-06-03 22:28:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295182063] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-03 22:28:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527589626] [2024-06-03 22:28:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:23,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-03 22:28:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-03 22:28:23,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-03 22:28:23,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:28:23,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 223 transitions, 3049 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:23,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:23,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:28:23,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:23,739 INFO L124 PetriNetUnfolderBase]: 635/1185 cut-off events. [2024-06-03 22:28:23,739 INFO L125 PetriNetUnfolderBase]: For 54871/54871 co-relation queries the response was YES. [2024-06-03 22:28:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8411 conditions, 1185 events. 635/1185 cut-off events. For 54871/54871 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 6492 event pairs, 210 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 8307. Up to 1144 conditions per place. [2024-06-03 22:28:23,750 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 219 selfloop transitions, 13 changer transitions 0/234 dead transitions. [2024-06-03 22:28:23,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 234 transitions, 3551 flow [2024-06-03 22:28:23,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 22:28:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 22:28:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2024-06-03 22:28:23,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951612903225806 [2024-06-03 22:28:23,752 INFO L175 Difference]: Start difference. First operand has 248 places, 223 transitions, 3049 flow. Second operand 8 states and 98 transitions. [2024-06-03 22:28:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 234 transitions, 3551 flow [2024-06-03 22:28:23,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 234 transitions, 3460 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:23,902 INFO L231 Difference]: Finished difference. Result has 248 places, 224 transitions, 3006 flow [2024-06-03 22:28:23,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3006, PETRI_PLACES=248, PETRI_TRANSITIONS=224} [2024-06-03 22:28:23,903 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-03 22:28:23,903 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 224 transitions, 3006 flow [2024-06-03 22:28:23,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:23,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:23,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:23,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-03 22:28:23,904 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:23,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash -904682038, now seen corresponding path program 4 times [2024-06-03 22:28:23,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:23,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634762135] [2024-06-03 22:28:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:28,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634762135] [2024-06-03 22:28:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634762135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:28,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602317512] [2024-06-03 22:28:28,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:28,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:28,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:28,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:28,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:28,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 224 transitions, 3006 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:28,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:28,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:28,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:29,014 INFO L124 PetriNetUnfolderBase]: 639/1193 cut-off events. [2024-06-03 22:28:29,014 INFO L125 PetriNetUnfolderBase]: For 56499/56499 co-relation queries the response was YES. [2024-06-03 22:28:29,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 1193 events. 639/1193 cut-off events. For 56499/56499 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6560 event pairs, 210 based on Foata normal form. 2/1195 useless extension candidates. Maximal degree in co-relation 8297. Up to 1149 conditions per place. [2024-06-03 22:28:29,025 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 216 selfloop transitions, 17 changer transitions 0/235 dead transitions. [2024-06-03 22:28:29,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 235 transitions, 3514 flow [2024-06-03 22:28:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:29,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-03 22:28:29,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35125448028673834 [2024-06-03 22:28:29,027 INFO L175 Difference]: Start difference. First operand has 248 places, 224 transitions, 3006 flow. Second operand 9 states and 98 transitions. [2024-06-03 22:28:29,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 235 transitions, 3514 flow [2024-06-03 22:28:29,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 235 transitions, 3476 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-03 22:28:29,178 INFO L231 Difference]: Finished difference. Result has 251 places, 225 transitions, 3027 flow [2024-06-03 22:28:29,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3027, PETRI_PLACES=251, PETRI_TRANSITIONS=225} [2024-06-03 22:28:29,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2024-06-03 22:28:29,179 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 225 transitions, 3027 flow [2024-06-03 22:28:29,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:29,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:29,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:29,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-03 22:28:29,179 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:29,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:29,180 INFO L85 PathProgramCache]: Analyzing trace with hash -913886744, now seen corresponding path program 14 times [2024-06-03 22:28:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836012553] [2024-06-03 22:28:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:33,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:33,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836012553] [2024-06-03 22:28:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836012553] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:33,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:33,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80767366] [2024-06-03 22:28:33,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:33,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:33,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:33,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:33,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 225 transitions, 3027 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:33,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:33,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:33,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:34,214 INFO L124 PetriNetUnfolderBase]: 633/1184 cut-off events. [2024-06-03 22:28:34,214 INFO L125 PetriNetUnfolderBase]: For 54915/54915 co-relation queries the response was YES. [2024-06-03 22:28:34,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8201 conditions, 1184 events. 633/1184 cut-off events. For 54915/54915 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6501 event pairs, 209 based on Foata normal form. 3/1187 useless extension candidates. Maximal degree in co-relation 8095. Up to 1126 conditions per place. [2024-06-03 22:28:34,225 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 211 selfloop transitions, 25 changer transitions 0/238 dead transitions. [2024-06-03 22:28:34,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 238 transitions, 3565 flow [2024-06-03 22:28:34,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:34,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-03 22:28:34,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35161290322580646 [2024-06-03 22:28:34,227 INFO L175 Difference]: Start difference. First operand has 251 places, 225 transitions, 3027 flow. Second operand 10 states and 109 transitions. [2024-06-03 22:28:34,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 238 transitions, 3565 flow [2024-06-03 22:28:34,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 238 transitions, 3508 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 22:28:34,362 INFO L231 Difference]: Finished difference. Result has 254 places, 227 transitions, 3069 flow [2024-06-03 22:28:34,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2970, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3069, PETRI_PLACES=254, PETRI_TRANSITIONS=227} [2024-06-03 22:28:34,362 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 224 predicate places. [2024-06-03 22:28:34,362 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 227 transitions, 3069 flow [2024-06-03 22:28:34,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:34,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:34,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:34,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-03 22:28:34,363 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:34,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:34,363 INFO L85 PathProgramCache]: Analyzing trace with hash 598689134, now seen corresponding path program 5 times [2024-06-03 22:28:34,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:34,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697730953] [2024-06-03 22:28:34,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:40,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697730953] [2024-06-03 22:28:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697730953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650030900] [2024-06-03 22:28:40,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:40,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:40,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:40,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 227 transitions, 3069 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:40,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:40,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:40,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:40,655 INFO L124 PetriNetUnfolderBase]: 637/1192 cut-off events. [2024-06-03 22:28:40,655 INFO L125 PetriNetUnfolderBase]: For 55110/55110 co-relation queries the response was YES. [2024-06-03 22:28:40,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8292 conditions, 1192 events. 637/1192 cut-off events. For 55110/55110 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6560 event pairs, 201 based on Foata normal form. 2/1194 useless extension candidates. Maximal degree in co-relation 8185. Up to 1135 conditions per place. [2024-06-03 22:28:40,666 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 221 selfloop transitions, 20 changer transitions 0/243 dead transitions. [2024-06-03 22:28:40,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 243 transitions, 3644 flow [2024-06-03 22:28:40,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2024-06-03 22:28:40,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3655913978494624 [2024-06-03 22:28:40,668 INFO L175 Difference]: Start difference. First operand has 254 places, 227 transitions, 3069 flow. Second operand 9 states and 102 transitions. [2024-06-03 22:28:40,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 243 transitions, 3644 flow [2024-06-03 22:28:40,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 243 transitions, 3505 flow, removed 21 selfloop flow, removed 9 redundant places. [2024-06-03 22:28:40,794 INFO L231 Difference]: Finished difference. Result has 255 places, 230 transitions, 3024 flow [2024-06-03 22:28:40,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2930, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3024, PETRI_PLACES=255, PETRI_TRANSITIONS=230} [2024-06-03 22:28:40,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 225 predicate places. [2024-06-03 22:28:40,795 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 230 transitions, 3024 flow [2024-06-03 22:28:40,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:40,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:40,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:40,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-03 22:28:40,795 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:40,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:40,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1170379318, now seen corresponding path program 6 times [2024-06-03 22:28:40,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:40,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467482061] [2024-06-03 22:28:40,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:40,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:45,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:45,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:45,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467482061] [2024-06-03 22:28:45,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467482061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:45,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:45,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:45,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761428838] [2024-06-03 22:28:45,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:45,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:45,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:45,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:45,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 230 transitions, 3024 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:45,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:45,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:45,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:46,417 INFO L124 PetriNetUnfolderBase]: 634/1187 cut-off events. [2024-06-03 22:28:46,418 INFO L125 PetriNetUnfolderBase]: For 53023/53023 co-relation queries the response was YES. [2024-06-03 22:28:46,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8059 conditions, 1187 events. 634/1187 cut-off events. For 53023/53023 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6547 event pairs, 202 based on Foata normal form. 2/1189 useless extension candidates. Maximal degree in co-relation 7951. Up to 1142 conditions per place. [2024-06-03 22:28:46,429 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 224 selfloop transitions, 17 changer transitions 0/243 dead transitions. [2024-06-03 22:28:46,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 243 transitions, 3563 flow [2024-06-03 22:28:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-03 22:28:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-03 22:28:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-03 22:28:46,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842293906810035 [2024-06-03 22:28:46,430 INFO L175 Difference]: Start difference. First operand has 255 places, 230 transitions, 3024 flow. Second operand 9 states and 100 transitions. [2024-06-03 22:28:46,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 243 transitions, 3563 flow [2024-06-03 22:28:46,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 243 transitions, 3436 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-06-03 22:28:46,577 INFO L231 Difference]: Finished difference. Result has 258 places, 232 transitions, 2970 flow [2024-06-03 22:28:46,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2899, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2970, PETRI_PLACES=258, PETRI_TRANSITIONS=232} [2024-06-03 22:28:46,577 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 228 predicate places. [2024-06-03 22:28:46,578 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 232 transitions, 2970 flow [2024-06-03 22:28:46,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:46,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:46,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:46,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-03 22:28:46,578 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:46,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:46,579 INFO L85 PathProgramCache]: Analyzing trace with hash -637990773, now seen corresponding path program 25 times [2024-06-03 22:28:46,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:46,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133158687] [2024-06-03 22:28:46,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:46,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:51,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:51,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133158687] [2024-06-03 22:28:51,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133158687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:51,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:51,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:28:51,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859971673] [2024-06-03 22:28:51,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:51,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:28:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:51,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:28:51,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:28:51,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:28:51,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 232 transitions, 2970 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:51,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:51,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:28:51,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:52,435 INFO L124 PetriNetUnfolderBase]: 670/1266 cut-off events. [2024-06-03 22:28:52,435 INFO L125 PetriNetUnfolderBase]: For 88214/88214 co-relation queries the response was YES. [2024-06-03 22:28:52,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8349 conditions, 1266 events. 670/1266 cut-off events. For 88214/88214 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 7073 event pairs, 206 based on Foata normal form. 22/1288 useless extension candidates. Maximal degree in co-relation 8240. Up to 1098 conditions per place. [2024-06-03 22:28:52,447 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 217 selfloop transitions, 21 changer transitions 12/252 dead transitions. [2024-06-03 22:28:52,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 252 transitions, 3602 flow [2024-06-03 22:28:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 116 transitions. [2024-06-03 22:28:52,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3741935483870968 [2024-06-03 22:28:52,448 INFO L175 Difference]: Start difference. First operand has 258 places, 232 transitions, 2970 flow. Second operand 10 states and 116 transitions. [2024-06-03 22:28:52,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 252 transitions, 3602 flow [2024-06-03 22:28:52,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 252 transitions, 3509 flow, removed 13 selfloop flow, removed 8 redundant places. [2024-06-03 22:28:52,603 INFO L231 Difference]: Finished difference. Result has 260 places, 226 transitions, 2867 flow [2024-06-03 22:28:52,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2877, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2867, PETRI_PLACES=260, PETRI_TRANSITIONS=226} [2024-06-03 22:28:52,603 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-03 22:28:52,603 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 226 transitions, 2867 flow [2024-06-03 22:28:52,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:52,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:52,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:52,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-03 22:28:52,604 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:52,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1170594644, now seen corresponding path program 15 times [2024-06-03 22:28:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336175034] [2024-06-03 22:28:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:28:57,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:28:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:28:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336175034] [2024-06-03 22:28:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336175034] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:28:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:28:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:28:57,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952385371] [2024-06-03 22:28:57,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:28:57,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:28:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:28:57,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:28:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:28:57,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:28:57,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 226 transitions, 2867 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:57,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:28:57,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:28:57,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:28:58,154 INFO L124 PetriNetUnfolderBase]: 624/1176 cut-off events. [2024-06-03 22:28:58,155 INFO L125 PetriNetUnfolderBase]: For 55365/55365 co-relation queries the response was YES. [2024-06-03 22:28:58,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7946 conditions, 1176 events. 624/1176 cut-off events. For 55365/55365 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6517 event pairs, 200 based on Foata normal form. 2/1178 useless extension candidates. Maximal degree in co-relation 7837. Up to 1125 conditions per place. [2024-06-03 22:28:58,166 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 221 selfloop transitions, 18 changer transitions 0/241 dead transitions. [2024-06-03 22:28:58,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 241 transitions, 3451 flow [2024-06-03 22:28:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:28:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:28:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:28:58,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:28:58,167 INFO L175 Difference]: Start difference. First operand has 260 places, 226 transitions, 2867 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:28:58,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 241 transitions, 3451 flow [2024-06-03 22:28:58,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 241 transitions, 3218 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-06-03 22:28:58,322 INFO L231 Difference]: Finished difference. Result has 259 places, 228 transitions, 2729 flow [2024-06-03 22:28:58,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2636, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2729, PETRI_PLACES=259, PETRI_TRANSITIONS=228} [2024-06-03 22:28:58,322 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-03 22:28:58,322 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 228 transitions, 2729 flow [2024-06-03 22:28:58,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:28:58,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:28:58,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:28:58,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-03 22:28:58,323 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:28:58,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:28:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 354404298, now seen corresponding path program 16 times [2024-06-03 22:28:58,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:28:58,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668678508] [2024-06-03 22:28:58,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:28:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:28:58,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:03,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668678508] [2024-06-03 22:29:03,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668678508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:03,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:03,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-03 22:29:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129079837] [2024-06-03 22:29:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:03,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-03 22:29:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:03,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-03 22:29:03,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-03 22:29:03,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2024-06-03 22:29:03,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 228 transitions, 2729 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:03,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:03,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2024-06-03 22:29:03,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:04,007 INFO L124 PetriNetUnfolderBase]: 620/1170 cut-off events. [2024-06-03 22:29:04,007 INFO L125 PetriNetUnfolderBase]: For 52341/52341 co-relation queries the response was YES. [2024-06-03 22:29:04,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7641 conditions, 1170 events. 620/1170 cut-off events. For 52341/52341 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 6464 event pairs, 193 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 7531. Up to 1099 conditions per place. [2024-06-03 22:29:04,018 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 216 selfloop transitions, 25 changer transitions 0/243 dead transitions. [2024-06-03 22:29:04,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 243 transitions, 3279 flow [2024-06-03 22:29:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:04,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:29:04,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:29:04,020 INFO L175 Difference]: Start difference. First operand has 259 places, 228 transitions, 2729 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:29:04,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 243 transitions, 3279 flow [2024-06-03 22:29:04,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 243 transitions, 3184 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:04,145 INFO L231 Difference]: Finished difference. Result has 261 places, 228 transitions, 2689 flow [2024-06-03 22:29:04,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2689, PETRI_PLACES=261, PETRI_TRANSITIONS=228} [2024-06-03 22:29:04,145 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-03 22:29:04,146 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 228 transitions, 2689 flow [2024-06-03 22:29:04,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:04,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:04,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:04,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-03 22:29:04,146 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:04,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:04,147 INFO L85 PathProgramCache]: Analyzing trace with hash 354404143, now seen corresponding path program 26 times [2024-06-03 22:29:04,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:04,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660227802] [2024-06-03 22:29:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:04,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:09,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:09,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:09,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660227802] [2024-06-03 22:29:09,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660227802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:09,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:09,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:09,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697302079] [2024-06-03 22:29:09,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:09,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:09,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:09,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:09,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 228 transitions, 2689 flow. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:09,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:09,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:09,846 INFO L124 PetriNetUnfolderBase]: 604/1142 cut-off events. [2024-06-03 22:29:09,847 INFO L125 PetriNetUnfolderBase]: For 49357/49357 co-relation queries the response was YES. [2024-06-03 22:29:09,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6730 conditions, 1142 events. 604/1142 cut-off events. For 49357/49357 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6356 event pairs, 179 based on Foata normal form. 12/1154 useless extension candidates. Maximal degree in co-relation 6619. Up to 1029 conditions per place. [2024-06-03 22:29:09,857 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 216 selfloop transitions, 21 changer transitions 8/247 dead transitions. [2024-06-03 22:29:09,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 247 transitions, 3283 flow [2024-06-03 22:29:09,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:29:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:29:09,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 22:29:09,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 22:29:09,858 INFO L175 Difference]: Start difference. First operand has 261 places, 228 transitions, 2689 flow. Second operand 10 states and 119 transitions. [2024-06-03 22:29:09,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 247 transitions, 3283 flow [2024-06-03 22:29:09,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 247 transitions, 3106 flow, removed 19 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:09,954 INFO L231 Difference]: Finished difference. Result has 261 places, 225 transitions, 2532 flow [2024-06-03 22:29:09,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2512, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2532, PETRI_PLACES=261, PETRI_TRANSITIONS=225} [2024-06-03 22:29:09,965 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2024-06-03 22:29:09,965 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 225 transitions, 2532 flow [2024-06-03 22:29:09,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:09,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:09,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:09,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-03 22:29:09,966 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:09,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1839162242, now seen corresponding path program 1 times [2024-06-03 22:29:09,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:09,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635540612] [2024-06-03 22:29:09,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:09,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:15,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635540612] [2024-06-03 22:29:15,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635540612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:15,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:15,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:15,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892190503] [2024-06-03 22:29:15,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:15,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:15,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:15,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 225 transitions, 2532 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:15,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:15,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:15,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:16,478 INFO L124 PetriNetUnfolderBase]: 619/1179 cut-off events. [2024-06-03 22:29:16,478 INFO L125 PetriNetUnfolderBase]: For 61800/61800 co-relation queries the response was YES. [2024-06-03 22:29:16,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7285 conditions, 1179 events. 619/1179 cut-off events. For 61800/61800 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 6619 event pairs, 122 based on Foata normal form. 8/1187 useless extension candidates. Maximal degree in co-relation 7174. Up to 610 conditions per place. [2024-06-03 22:29:16,489 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 182 selfloop transitions, 56 changer transitions 15/255 dead transitions. [2024-06-03 22:29:16,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 255 transitions, 3300 flow [2024-06-03 22:29:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 146 transitions. [2024-06-03 22:29:16,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281524926686217 [2024-06-03 22:29:16,490 INFO L175 Difference]: Start difference. First operand has 261 places, 225 transitions, 2532 flow. Second operand 11 states and 146 transitions. [2024-06-03 22:29:16,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 255 transitions, 3300 flow [2024-06-03 22:29:16,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 255 transitions, 3170 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:16,636 INFO L231 Difference]: Finished difference. Result has 262 places, 220 transitions, 2456 flow [2024-06-03 22:29:16,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2404, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2456, PETRI_PLACES=262, PETRI_TRANSITIONS=220} [2024-06-03 22:29:16,637 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2024-06-03 22:29:16,637 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 220 transitions, 2456 flow [2024-06-03 22:29:16,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:16,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:16,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:16,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-03 22:29:16,637 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:16,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:16,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1744086420, now seen corresponding path program 2 times [2024-06-03 22:29:16,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:16,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579855747] [2024-06-03 22:29:16,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:16,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:22,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:22,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:22,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579855747] [2024-06-03 22:29:22,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579855747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:22,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:22,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:22,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478712252] [2024-06-03 22:29:22,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:22,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:22,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:22,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:22,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 220 transitions, 2456 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:22,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:22,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:22,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:22,966 INFO L124 PetriNetUnfolderBase]: 628/1204 cut-off events. [2024-06-03 22:29:22,967 INFO L125 PetriNetUnfolderBase]: For 81432/81432 co-relation queries the response was YES. [2024-06-03 22:29:22,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7871 conditions, 1204 events. 628/1204 cut-off events. For 81432/81432 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6813 event pairs, 136 based on Foata normal form. 8/1212 useless extension candidates. Maximal degree in co-relation 7760. Up to 830 conditions per place. [2024-06-03 22:29:22,979 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 184 selfloop transitions, 55 changer transitions 7/248 dead transitions. [2024-06-03 22:29:22,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 248 transitions, 3208 flow [2024-06-03 22:29:22,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:22,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:22,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2024-06-03 22:29:22,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2024-06-03 22:29:22,982 INFO L175 Difference]: Start difference. First operand has 262 places, 220 transitions, 2456 flow. Second operand 11 states and 144 transitions. [2024-06-03 22:29:22,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 248 transitions, 3208 flow [2024-06-03 22:29:23,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 248 transitions, 3101 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:23,137 INFO L231 Difference]: Finished difference. Result has 260 places, 218 transitions, 2440 flow [2024-06-03 22:29:23,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2351, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2440, PETRI_PLACES=260, PETRI_TRANSITIONS=218} [2024-06-03 22:29:23,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-03 22:29:23,137 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 218 transitions, 2440 flow [2024-06-03 22:29:23,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:23,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:23,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:23,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-03 22:29:23,138 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:23,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1744201740, now seen corresponding path program 3 times [2024-06-03 22:29:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:23,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832381352] [2024-06-03 22:29:23,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:23,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:28,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:28,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832381352] [2024-06-03 22:29:28,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832381352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:28,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:28,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803673501] [2024-06-03 22:29:28,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:28,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:28,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:28,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:28,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:28,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 218 transitions, 2440 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:28,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:28,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:28,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:29,247 INFO L124 PetriNetUnfolderBase]: 622/1194 cut-off events. [2024-06-03 22:29:29,248 INFO L125 PetriNetUnfolderBase]: For 81332/81332 co-relation queries the response was YES. [2024-06-03 22:29:29,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7853 conditions, 1194 events. 622/1194 cut-off events. For 81332/81332 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6760 event pairs, 134 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 7743. Up to 812 conditions per place. [2024-06-03 22:29:29,257 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 182 selfloop transitions, 53 changer transitions 10/247 dead transitions. [2024-06-03 22:29:29,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 247 transitions, 3192 flow [2024-06-03 22:29:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:29,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:29:29,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-03 22:29:29,264 INFO L175 Difference]: Start difference. First operand has 260 places, 218 transitions, 2440 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:29:29,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 247 transitions, 3192 flow [2024-06-03 22:29:29,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 247 transitions, 3078 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:29,423 INFO L231 Difference]: Finished difference. Result has 260 places, 215 transitions, 2396 flow [2024-06-03 22:29:29,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2328, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2396, PETRI_PLACES=260, PETRI_TRANSITIONS=215} [2024-06-03 22:29:29,423 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 230 predicate places. [2024-06-03 22:29:29,423 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 215 transitions, 2396 flow [2024-06-03 22:29:29,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:29,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:29,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:29,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-03 22:29:29,424 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:29,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1744081770, now seen corresponding path program 4 times [2024-06-03 22:29:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:29,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842031927] [2024-06-03 22:29:29,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:29,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:34,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:34,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842031927] [2024-06-03 22:29:34,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842031927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:34,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:34,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:34,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619874809] [2024-06-03 22:29:34,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:34,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:34,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:34,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:34,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 215 transitions, 2396 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:34,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:34,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:34,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:35,270 INFO L124 PetriNetUnfolderBase]: 587/1125 cut-off events. [2024-06-03 22:29:35,271 INFO L125 PetriNetUnfolderBase]: For 65696/65696 co-relation queries the response was YES. [2024-06-03 22:29:35,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6953 conditions, 1125 events. 587/1125 cut-off events. For 65696/65696 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6291 event pairs, 120 based on Foata normal form. 10/1135 useless extension candidates. Maximal degree in co-relation 6843. Up to 795 conditions per place. [2024-06-03 22:29:35,280 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 167 selfloop transitions, 51 changer transitions 18/238 dead transitions. [2024-06-03 22:29:35,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 238 transitions, 2970 flow [2024-06-03 22:29:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2024-06-03 22:29:35,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2024-06-03 22:29:35,281 INFO L175 Difference]: Start difference. First operand has 260 places, 215 transitions, 2396 flow. Second operand 11 states and 138 transitions. [2024-06-03 22:29:35,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 238 transitions, 2970 flow [2024-06-03 22:29:35,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 238 transitions, 2860 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:35,405 INFO L231 Difference]: Finished difference. Result has 259 places, 208 transitions, 2302 flow [2024-06-03 22:29:35,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2286, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2302, PETRI_PLACES=259, PETRI_TRANSITIONS=208} [2024-06-03 22:29:35,405 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 229 predicate places. [2024-06-03 22:29:35,406 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 208 transitions, 2302 flow [2024-06-03 22:29:35,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:35,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:35,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:35,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-03 22:29:35,406 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:35,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1678740864, now seen corresponding path program 5 times [2024-06-03 22:29:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626024879] [2024-06-03 22:29:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:40,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:40,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:40,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626024879] [2024-06-03 22:29:40,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626024879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:40,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:40,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:40,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54277617] [2024-06-03 22:29:40,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:40,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:40,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:40,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:40,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:40,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 208 transitions, 2302 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:40,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:40,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:40,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:41,271 INFO L124 PetriNetUnfolderBase]: 573/1100 cut-off events. [2024-06-03 22:29:41,271 INFO L125 PetriNetUnfolderBase]: For 65593/65593 co-relation queries the response was YES. [2024-06-03 22:29:41,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 1100 events. 573/1100 cut-off events. For 65593/65593 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 6143 event pairs, 118 based on Foata normal form. 10/1110 useless extension candidates. Maximal degree in co-relation 6665. Up to 836 conditions per place. [2024-06-03 22:29:41,281 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 175 selfloop transitions, 42 changer transitions 11/230 dead transitions. [2024-06-03 22:29:41,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 230 transitions, 2856 flow [2024-06-03 22:29:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:41,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-03 22:29:41,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-03 22:29:41,282 INFO L175 Difference]: Start difference. First operand has 259 places, 208 transitions, 2302 flow. Second operand 11 states and 139 transitions. [2024-06-03 22:29:41,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 230 transitions, 2856 flow [2024-06-03 22:29:41,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 230 transitions, 2717 flow, removed 7 selfloop flow, removed 10 redundant places. [2024-06-03 22:29:41,407 INFO L231 Difference]: Finished difference. Result has 251 places, 205 transitions, 2220 flow [2024-06-03 22:29:41,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2220, PETRI_PLACES=251, PETRI_TRANSITIONS=205} [2024-06-03 22:29:41,407 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 221 predicate places. [2024-06-03 22:29:41,408 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 205 transitions, 2220 flow [2024-06-03 22:29:41,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:41,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:41,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:41,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-03 22:29:41,408 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:41,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash 947828340, now seen corresponding path program 6 times [2024-06-03 22:29:41,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:41,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614975598] [2024-06-03 22:29:41,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:41,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:46,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614975598] [2024-06-03 22:29:46,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614975598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893798999] [2024-06-03 22:29:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:46,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:46,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:46,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:46,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 205 transitions, 2220 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:46,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:46,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:46,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:47,142 INFO L124 PetriNetUnfolderBase]: 561/1080 cut-off events. [2024-06-03 22:29:47,142 INFO L125 PetriNetUnfolderBase]: For 61429/61429 co-relation queries the response was YES. [2024-06-03 22:29:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6578 conditions, 1080 events. 561/1080 cut-off events. For 61429/61429 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6024 event pairs, 114 based on Foata normal form. 8/1088 useless extension candidates. Maximal degree in co-relation 6471. Up to 826 conditions per place. [2024-06-03 22:29:47,151 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 173 selfloop transitions, 40 changer transitions 11/226 dead transitions. [2024-06-03 22:29:47,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 226 transitions, 2750 flow [2024-06-03 22:29:47,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-03 22:29:47,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-03 22:29:47,152 INFO L175 Difference]: Start difference. First operand has 251 places, 205 transitions, 2220 flow. Second operand 11 states and 136 transitions. [2024-06-03 22:29:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 226 transitions, 2750 flow [2024-06-03 22:29:47,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 226 transitions, 2660 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:29:47,253 INFO L231 Difference]: Finished difference. Result has 250 places, 202 transitions, 2171 flow [2024-06-03 22:29:47,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2171, PETRI_PLACES=250, PETRI_TRANSITIONS=202} [2024-06-03 22:29:47,254 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 220 predicate places. [2024-06-03 22:29:47,254 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 202 transitions, 2171 flow [2024-06-03 22:29:47,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:47,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:47,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:47,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-03 22:29:47,254 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:47,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash -117533720, now seen corresponding path program 7 times [2024-06-03 22:29:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:47,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260388106] [2024-06-03 22:29:47,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:47,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:53,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260388106] [2024-06-03 22:29:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260388106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:53,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:53,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878957373] [2024-06-03 22:29:53,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:53,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:53,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:53,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:53,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 202 transitions, 2171 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:53,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:29:53,758 INFO L124 PetriNetUnfolderBase]: 583/1126 cut-off events. [2024-06-03 22:29:53,758 INFO L125 PetriNetUnfolderBase]: For 80994/80994 co-relation queries the response was YES. [2024-06-03 22:29:53,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7338 conditions, 1126 events. 583/1126 cut-off events. For 80994/80994 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 6288 event pairs, 124 based on Foata normal form. 8/1134 useless extension candidates. Maximal degree in co-relation 7231. Up to 797 conditions per place. [2024-06-03 22:29:53,766 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 179 selfloop transitions, 39 changer transitions 10/230 dead transitions. [2024-06-03 22:29:53,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 230 transitions, 2885 flow [2024-06-03 22:29:53,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:29:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:29:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:29:53,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-03 22:29:53,767 INFO L175 Difference]: Start difference. First operand has 250 places, 202 transitions, 2171 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:29:53,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 230 transitions, 2885 flow [2024-06-03 22:29:53,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 230 transitions, 2795 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-03 22:29:53,923 INFO L231 Difference]: Finished difference. Result has 248 places, 199 transitions, 2122 flow [2024-06-03 22:29:53,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2083, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2122, PETRI_PLACES=248, PETRI_TRANSITIONS=199} [2024-06-03 22:29:53,926 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 218 predicate places. [2024-06-03 22:29:53,926 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 199 transitions, 2122 flow [2024-06-03 22:29:53,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:53,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:29:53,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:29:53,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-03 22:29:53,927 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:29:53,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:29:53,927 INFO L85 PathProgramCache]: Analyzing trace with hash -117413750, now seen corresponding path program 8 times [2024-06-03 22:29:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:29:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641048713] [2024-06-03 22:29:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:29:53,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:29:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:29:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:29:59,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:29:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641048713] [2024-06-03 22:29:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641048713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:29:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:29:59,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:29:59,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850101227] [2024-06-03 22:29:59,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:29:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:29:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:29:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:29:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:29:59,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:29:59,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 199 transitions, 2122 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:29:59,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:29:59,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:29:59,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:00,306 INFO L124 PetriNetUnfolderBase]: 570/1103 cut-off events. [2024-06-03 22:30:00,306 INFO L125 PetriNetUnfolderBase]: For 80934/80934 co-relation queries the response was YES. [2024-06-03 22:30:00,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7090 conditions, 1103 events. 570/1103 cut-off events. For 80934/80934 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6144 event pairs, 133 based on Foata normal form. 10/1113 useless extension candidates. Maximal degree in co-relation 6983. Up to 853 conditions per place. [2024-06-03 22:30:00,316 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 170 selfloop transitions, 38 changer transitions 11/221 dead transitions. [2024-06-03 22:30:00,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 221 transitions, 2658 flow [2024-06-03 22:30:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2024-06-03 22:30:00,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40175953079178883 [2024-06-03 22:30:00,317 INFO L175 Difference]: Start difference. First operand has 248 places, 199 transitions, 2122 flow. Second operand 11 states and 137 transitions. [2024-06-03 22:30:00,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 221 transitions, 2658 flow [2024-06-03 22:30:00,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 221 transitions, 2556 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:00,445 INFO L231 Difference]: Finished difference. Result has 245 places, 196 transitions, 2067 flow [2024-06-03 22:30:00,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2067, PETRI_PLACES=245, PETRI_TRANSITIONS=196} [2024-06-03 22:30:00,446 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2024-06-03 22:30:00,446 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 196 transitions, 2067 flow [2024-06-03 22:30:00,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:00,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:00,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:00,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-03 22:30:00,447 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:00,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:00,447 INFO L85 PathProgramCache]: Analyzing trace with hash -117418400, now seen corresponding path program 9 times [2024-06-03 22:30:00,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:00,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793229362] [2024-06-03 22:30:00,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:00,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:05,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:05,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793229362] [2024-06-03 22:30:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793229362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:05,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:05,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:05,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123295596] [2024-06-03 22:30:05,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:05,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:05,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:05,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:05,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:05,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 196 transitions, 2067 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:05,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:05,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:05,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:06,102 INFO L124 PetriNetUnfolderBase]: 536/1037 cut-off events. [2024-06-03 22:30:06,102 INFO L125 PetriNetUnfolderBase]: For 61263/61263 co-relation queries the response was YES. [2024-06-03 22:30:06,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6271 conditions, 1037 events. 536/1037 cut-off events. For 61263/61263 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 5726 event pairs, 111 based on Foata normal form. 8/1045 useless extension candidates. Maximal degree in co-relation 6165. Up to 797 conditions per place. [2024-06-03 22:30:06,111 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 167 selfloop transitions, 35 changer transitions 13/217 dead transitions. [2024-06-03 22:30:06,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 217 transitions, 2579 flow [2024-06-03 22:30:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 134 transitions. [2024-06-03 22:30:06,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39296187683284456 [2024-06-03 22:30:06,112 INFO L175 Difference]: Start difference. First operand has 245 places, 196 transitions, 2067 flow. Second operand 11 states and 134 transitions. [2024-06-03 22:30:06,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 217 transitions, 2579 flow [2024-06-03 22:30:06,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 217 transitions, 2497 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:06,260 INFO L231 Difference]: Finished difference. Result has 244 places, 192 transitions, 2005 flow [2024-06-03 22:30:06,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2005, PETRI_PLACES=244, PETRI_TRANSITIONS=192} [2024-06-03 22:30:06,261 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2024-06-03 22:30:06,261 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 192 transitions, 2005 flow [2024-06-03 22:30:06,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:06,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:06,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:06,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-03 22:30:06,261 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:06,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:06,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1311928148, now seen corresponding path program 10 times [2024-06-03 22:30:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227929954] [2024-06-03 22:30:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227929954] [2024-06-03 22:30:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227929954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076175506] [2024-06-03 22:30:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:12,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:12,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:12,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 192 transitions, 2005 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:12,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:12,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:12,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:12,609 INFO L124 PetriNetUnfolderBase]: 528/1021 cut-off events. [2024-06-03 22:30:12,610 INFO L125 PetriNetUnfolderBase]: For 61161/61161 co-relation queries the response was YES. [2024-06-03 22:30:12,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 1021 events. 528/1021 cut-off events. For 61161/61161 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5579 event pairs, 64 based on Foata normal form. 8/1029 useless extension candidates. Maximal degree in co-relation 6063. Up to 579 conditions per place. [2024-06-03 22:30:12,617 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 123 selfloop transitions, 73 changer transitions 17/215 dead transitions. [2024-06-03 22:30:12,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 215 transitions, 2507 flow [2024-06-03 22:30:12,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:12,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 22:30:12,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-03 22:30:12,618 INFO L175 Difference]: Start difference. First operand has 244 places, 192 transitions, 2005 flow. Second operand 11 states and 129 transitions. [2024-06-03 22:30:12,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 215 transitions, 2507 flow [2024-06-03 22:30:12,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 215 transitions, 2418 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:12,748 INFO L231 Difference]: Finished difference. Result has 238 places, 188 transitions, 2036 flow [2024-06-03 22:30:12,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2036, PETRI_PLACES=238, PETRI_TRANSITIONS=188} [2024-06-03 22:30:12,748 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 208 predicate places. [2024-06-03 22:30:12,748 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 188 transitions, 2036 flow [2024-06-03 22:30:12,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:12,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:12,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:12,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-03 22:30:12,749 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:12,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:12,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1956000312, now seen corresponding path program 11 times [2024-06-03 22:30:12,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657209487] [2024-06-03 22:30:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:12,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:18,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:18,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657209487] [2024-06-03 22:30:18,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657209487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:18,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:18,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:18,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632148875] [2024-06-03 22:30:18,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:18,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:18,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:18,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:18,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:19,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:19,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 188 transitions, 2036 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:19,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:19,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:19,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:19,525 INFO L124 PetriNetUnfolderBase]: 542/1049 cut-off events. [2024-06-03 22:30:19,525 INFO L125 PetriNetUnfolderBase]: For 78323/78323 co-relation queries the response was YES. [2024-06-03 22:30:19,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 1049 events. 542/1049 cut-off events. For 78323/78323 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5729 event pairs, 93 based on Foata normal form. 8/1057 useless extension candidates. Maximal degree in co-relation 6889. Up to 719 conditions per place. [2024-06-03 22:30:19,535 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 145 selfloop transitions, 56 changer transitions 15/218 dead transitions. [2024-06-03 22:30:19,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 218 transitions, 2720 flow [2024-06-03 22:30:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:30:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:30:19,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2024-06-03 22:30:19,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40053763440860213 [2024-06-03 22:30:19,536 INFO L175 Difference]: Start difference. First operand has 238 places, 188 transitions, 2036 flow. Second operand 12 states and 149 transitions. [2024-06-03 22:30:19,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 218 transitions, 2720 flow [2024-06-03 22:30:19,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 218 transitions, 2518 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:19,713 INFO L231 Difference]: Finished difference. Result has 233 places, 184 transitions, 1915 flow [2024-06-03 22:30:19,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1915, PETRI_PLACES=233, PETRI_TRANSITIONS=184} [2024-06-03 22:30:19,714 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-03 22:30:19,714 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 184 transitions, 1915 flow [2024-06-03 22:30:19,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:19,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:19,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:19,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-03 22:30:19,715 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:19,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:19,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1065520576, now seen corresponding path program 12 times [2024-06-03 22:30:19,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126630536] [2024-06-03 22:30:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:19,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:25,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:25,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126630536] [2024-06-03 22:30:25,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126630536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:25,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:25,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:25,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795663655] [2024-06-03 22:30:25,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:25,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:25,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:25,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:25,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:25,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 184 transitions, 1915 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:25,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:25,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:25,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:25,894 INFO L124 PetriNetUnfolderBase]: 548/1065 cut-off events. [2024-06-03 22:30:25,894 INFO L125 PetriNetUnfolderBase]: For 92952/92952 co-relation queries the response was YES. [2024-06-03 22:30:25,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7386 conditions, 1065 events. 548/1065 cut-off events. For 92952/92952 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5846 event pairs, 105 based on Foata normal form. 8/1073 useless extension candidates. Maximal degree in co-relation 7282. Up to 783 conditions per place. [2024-06-03 22:30:25,906 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 144 selfloop transitions, 57 changer transitions 8/211 dead transitions. [2024-06-03 22:30:25,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 211 transitions, 2577 flow [2024-06-03 22:30:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:30:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:30:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 143 transitions. [2024-06-03 22:30:25,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844086021505376 [2024-06-03 22:30:25,907 INFO L175 Difference]: Start difference. First operand has 233 places, 184 transitions, 1915 flow. Second operand 12 states and 143 transitions. [2024-06-03 22:30:25,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 211 transitions, 2577 flow [2024-06-03 22:30:26,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 211 transitions, 2455 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:26,108 INFO L231 Difference]: Finished difference. Result has 230 places, 182 transitions, 1895 flow [2024-06-03 22:30:26,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1895, PETRI_PLACES=230, PETRI_TRANSITIONS=182} [2024-06-03 22:30:26,108 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 200 predicate places. [2024-06-03 22:30:26,108 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 182 transitions, 1895 flow [2024-06-03 22:30:26,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:26,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:26,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:26,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-03 22:30:26,109 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:26,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:26,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1897787892, now seen corresponding path program 13 times [2024-06-03 22:30:26,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:26,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774732086] [2024-06-03 22:30:26,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:26,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774732086] [2024-06-03 22:30:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774732086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:32,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:32,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872032079] [2024-06-03 22:30:32,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:32,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:32,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 182 transitions, 1895 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:32,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:32,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:32,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:33,064 INFO L124 PetriNetUnfolderBase]: 517/1004 cut-off events. [2024-06-03 22:30:33,064 INFO L125 PetriNetUnfolderBase]: For 77822/77822 co-relation queries the response was YES. [2024-06-03 22:30:33,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6543 conditions, 1004 events. 517/1004 cut-off events. For 77822/77822 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5442 event pairs, 98 based on Foata normal form. 10/1014 useless extension candidates. Maximal degree in co-relation 6440. Up to 783 conditions per place. [2024-06-03 22:30:33,071 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 134 selfloop transitions, 53 changer transitions 14/203 dead transitions. [2024-06-03 22:30:33,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 203 transitions, 2383 flow [2024-06-03 22:30:33,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-06-03 22:30:33,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3782991202346041 [2024-06-03 22:30:33,073 INFO L175 Difference]: Start difference. First operand has 230 places, 182 transitions, 1895 flow. Second operand 11 states and 129 transitions. [2024-06-03 22:30:33,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 203 transitions, 2383 flow [2024-06-03 22:30:33,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 203 transitions, 2267 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:30:33,220 INFO L231 Difference]: Finished difference. Result has 229 places, 178 transitions, 1850 flow [2024-06-03 22:30:33,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1850, PETRI_PLACES=229, PETRI_TRANSITIONS=178} [2024-06-03 22:30:33,221 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 199 predicate places. [2024-06-03 22:30:33,221 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 178 transitions, 1850 flow [2024-06-03 22:30:33,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:33,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:33,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:33,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-03 22:30:33,222 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:33,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1897907862, now seen corresponding path program 14 times [2024-06-03 22:30:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409800665] [2024-06-03 22:30:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:39,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:39,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409800665] [2024-06-03 22:30:39,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409800665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:39,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:39,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263040026] [2024-06-03 22:30:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:39,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:39,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:40,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:40,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 178 transitions, 1850 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:40,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:40,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:40,467 INFO L124 PetriNetUnfolderBase]: 482/935 cut-off events. [2024-06-03 22:30:40,468 INFO L125 PetriNetUnfolderBase]: For 59003/59003 co-relation queries the response was YES. [2024-06-03 22:30:40,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5765 conditions, 935 events. 482/935 cut-off events. For 59003/59003 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 4984 event pairs, 72 based on Foata normal form. 8/943 useless extension candidates. Maximal degree in co-relation 5662. Up to 719 conditions per place. [2024-06-03 22:30:40,476 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 128 selfloop transitions, 49 changer transitions 20/199 dead transitions. [2024-06-03 22:30:40,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 199 transitions, 2316 flow [2024-06-03 22:30:40,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 127 transitions. [2024-06-03 22:30:40,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724340175953079 [2024-06-03 22:30:40,477 INFO L175 Difference]: Start difference. First operand has 229 places, 178 transitions, 1850 flow. Second operand 11 states and 127 transitions. [2024-06-03 22:30:40,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 199 transitions, 2316 flow [2024-06-03 22:30:40,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 199 transitions, 2166 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:40,641 INFO L231 Difference]: Finished difference. Result has 225 places, 172 transitions, 1740 flow [2024-06-03 22:30:40,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1740, PETRI_PLACES=225, PETRI_TRANSITIONS=172} [2024-06-03 22:30:40,642 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2024-06-03 22:30:40,642 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 172 transitions, 1740 flow [2024-06-03 22:30:40,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:40,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:40,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:40,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-03 22:30:40,645 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:40,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:40,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1889465770, now seen corresponding path program 15 times [2024-06-03 22:30:40,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:40,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628220210] [2024-06-03 22:30:40,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:40,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:46,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:46,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628220210] [2024-06-03 22:30:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628220210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:46,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:46,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:46,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112728832] [2024-06-03 22:30:46,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:46,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:46,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:46,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:46,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:46,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 172 transitions, 1740 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:46,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:46,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:46,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:47,035 INFO L124 PetriNetUnfolderBase]: 468/901 cut-off events. [2024-06-03 22:30:47,035 INFO L125 PetriNetUnfolderBase]: For 58841/58841 co-relation queries the response was YES. [2024-06-03 22:30:47,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 901 events. 468/901 cut-off events. For 58841/58841 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4740 event pairs, 69 based on Foata normal form. 8/909 useless extension candidates. Maximal degree in co-relation 5471. Up to 510 conditions per place. [2024-06-03 22:30:47,044 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 42 changer transitions 12/202 dead transitions. [2024-06-03 22:30:47,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 202 transitions, 2406 flow [2024-06-03 22:30:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:47,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:47,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:30:47,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-03 22:30:47,054 INFO L175 Difference]: Start difference. First operand has 225 places, 172 transitions, 1740 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:30:47,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 202 transitions, 2406 flow [2024-06-03 22:30:47,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 202 transitions, 2216 flow, removed 12 selfloop flow, removed 12 redundant places. [2024-06-03 22:30:47,174 INFO L231 Difference]: Finished difference. Result has 214 places, 169 transitions, 1616 flow [2024-06-03 22:30:47,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1616, PETRI_PLACES=214, PETRI_TRANSITIONS=169} [2024-06-03 22:30:47,174 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 184 predicate places. [2024-06-03 22:30:47,174 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 169 transitions, 1616 flow [2024-06-03 22:30:47,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:47,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:47,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:47,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-03 22:30:47,175 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:47,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1889581090, now seen corresponding path program 16 times [2024-06-03 22:30:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681232169] [2024-06-03 22:30:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:53,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-03 22:30:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681232169] [2024-06-03 22:30:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681232169] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847058680] [2024-06-03 22:30:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:53,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:53,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:53,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:53,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:53,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 169 transitions, 1616 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:53,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:53,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:53,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:30:54,173 INFO L124 PetriNetUnfolderBase]: 483/932 cut-off events. [2024-06-03 22:30:54,173 INFO L125 PetriNetUnfolderBase]: For 75617/75617 co-relation queries the response was YES. [2024-06-03 22:30:54,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6026 conditions, 932 events. 483/932 cut-off events. For 75617/75617 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4934 event pairs, 84 based on Foata normal form. 8/940 useless extension candidates. Maximal degree in co-relation 5928. Up to 601 conditions per place. [2024-06-03 22:30:54,181 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 42 changer transitions 8/198 dead transitions. [2024-06-03 22:30:54,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 198 transitions, 2266 flow [2024-06-03 22:30:54,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:30:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:30:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 145 transitions. [2024-06-03 22:30:54,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4252199413489736 [2024-06-03 22:30:54,182 INFO L175 Difference]: Start difference. First operand has 214 places, 169 transitions, 1616 flow. Second operand 11 states and 145 transitions. [2024-06-03 22:30:54,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 198 transitions, 2266 flow [2024-06-03 22:30:54,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 198 transitions, 2181 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-03 22:30:54,329 INFO L231 Difference]: Finished difference. Result has 212 places, 167 transitions, 1599 flow [2024-06-03 22:30:54,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1599, PETRI_PLACES=212, PETRI_TRANSITIONS=167} [2024-06-03 22:30:54,330 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-03 22:30:54,330 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 167 transitions, 1599 flow [2024-06-03 22:30:54,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:54,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:30:54,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:30:54,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-03 22:30:54,330 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:30:54,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:30:54,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1889585740, now seen corresponding path program 17 times [2024-06-03 22:30:54,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:30:54,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355445679] [2024-06-03 22:30:54,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:30:54,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:30:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:30:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:30:59,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:30:59,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355445679] [2024-06-03 22:30:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355445679] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:30:59,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:30:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:30:59,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824167669] [2024-06-03 22:30:59,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:30:59,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:30:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:30:59,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:30:59,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:30:59,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:30:59,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 167 transitions, 1599 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:30:59,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:30:59,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:30:59,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:00,389 INFO L124 PetriNetUnfolderBase]: 452/871 cut-off events. [2024-06-03 22:31:00,389 INFO L125 PetriNetUnfolderBase]: For 60902/60902 co-relation queries the response was YES. [2024-06-03 22:31:00,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5211 conditions, 871 events. 452/871 cut-off events. For 60902/60902 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 4558 event pairs, 75 based on Foata normal form. 10/881 useless extension candidates. Maximal degree in co-relation 5114. Up to 601 conditions per place. [2024-06-03 22:31:00,396 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 136 selfloop transitions, 38 changer transitions 15/191 dead transitions. [2024-06-03 22:31:00,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 191 transitions, 2083 flow [2024-06-03 22:31:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 139 transitions. [2024-06-03 22:31:00,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2024-06-03 22:31:00,397 INFO L175 Difference]: Start difference. First operand has 212 places, 167 transitions, 1599 flow. Second operand 11 states and 139 transitions. [2024-06-03 22:31:00,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 191 transitions, 2083 flow [2024-06-03 22:31:00,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 191 transitions, 1997 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:31:00,497 INFO L231 Difference]: Finished difference. Result has 212 places, 162 transitions, 1535 flow [2024-06-03 22:31:00,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=212, PETRI_TRANSITIONS=162} [2024-06-03 22:31:00,497 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 182 predicate places. [2024-06-03 22:31:00,497 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 162 transitions, 1535 flow [2024-06-03 22:31:00,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:00,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:00,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:00,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-03 22:31:00,498 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:00,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2060283520, now seen corresponding path program 18 times [2024-06-03 22:31:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425436600] [2024-06-03 22:31:00,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425436600] [2024-06-03 22:31:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425436600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:06,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:06,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:06,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798726855] [2024-06-03 22:31:06,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:06,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:06,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 162 transitions, 1535 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:06,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:06,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:06,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:07,159 INFO L124 PetriNetUnfolderBase]: 465/900 cut-off events. [2024-06-03 22:31:07,160 INFO L125 PetriNetUnfolderBase]: For 75549/75549 co-relation queries the response was YES. [2024-06-03 22:31:07,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5838 conditions, 900 events. 465/900 cut-off events. For 75549/75549 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4732 event pairs, 82 based on Foata normal form. 8/908 useless extension candidates. Maximal degree in co-relation 5741. Up to 594 conditions per place. [2024-06-03 22:31:07,168 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 146 selfloop transitions, 36 changer transitions 7/191 dead transitions. [2024-06-03 22:31:07,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 191 transitions, 2172 flow [2024-06-03 22:31:07,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:31:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:31:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 150 transitions. [2024-06-03 22:31:07,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-06-03 22:31:07,169 INFO L175 Difference]: Start difference. First operand has 212 places, 162 transitions, 1535 flow. Second operand 12 states and 150 transitions. [2024-06-03 22:31:07,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 191 transitions, 2172 flow [2024-06-03 22:31:07,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 191 transitions, 2078 flow, removed 9 selfloop flow, removed 9 redundant places. [2024-06-03 22:31:07,292 INFO L231 Difference]: Finished difference. Result has 208 places, 160 transitions, 1498 flow [2024-06-03 22:31:07,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1443, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1498, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2024-06-03 22:31:07,293 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:31:07,293 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 1498 flow [2024-06-03 22:31:07,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:07,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:07,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:07,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-03 22:31:07,293 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:07,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:07,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1324070394, now seen corresponding path program 19 times [2024-06-03 22:31:07,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:07,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857075085] [2024-06-03 22:31:07,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:07,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:13,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:13,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857075085] [2024-06-03 22:31:13,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857075085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309798557] [2024-06-03 22:31:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:13,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:13,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:13,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 1498 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:13,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:13,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:13,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:14,364 INFO L124 PetriNetUnfolderBase]: 434/839 cut-off events. [2024-06-03 22:31:14,364 INFO L125 PetriNetUnfolderBase]: For 60809/60809 co-relation queries the response was YES. [2024-06-03 22:31:14,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4987 conditions, 839 events. 434/839 cut-off events. For 60809/60809 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4342 event pairs, 74 based on Foata normal form. 10/849 useless extension candidates. Maximal degree in co-relation 4891. Up to 577 conditions per place. [2024-06-03 22:31:14,371 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 133 selfloop transitions, 36 changer transitions 13/184 dead transitions. [2024-06-03 22:31:14,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 184 transitions, 1969 flow [2024-06-03 22:31:14,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:31:14,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:31:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2024-06-03 22:31:14,373 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3897849462365591 [2024-06-03 22:31:14,373 INFO L175 Difference]: Start difference. First operand has 208 places, 160 transitions, 1498 flow. Second operand 12 states and 145 transitions. [2024-06-03 22:31:14,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 184 transitions, 1969 flow [2024-06-03 22:31:14,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 184 transitions, 1895 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:14,536 INFO L231 Difference]: Finished difference. Result has 208 places, 156 transitions, 1458 flow [2024-06-03 22:31:14,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1458, PETRI_PLACES=208, PETRI_TRANSITIONS=156} [2024-06-03 22:31:14,536 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:31:14,536 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 156 transitions, 1458 flow [2024-06-03 22:31:14,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:14,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:14,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:14,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-03 22:31:14,537 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:14,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:14,538 INFO L85 PathProgramCache]: Analyzing trace with hash -256625630, now seen corresponding path program 1 times [2024-06-03 22:31:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78931245] [2024-06-03 22:31:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78931245] [2024-06-03 22:31:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78931245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:20,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141968002] [2024-06-03 22:31:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:20,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:20,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:20,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:21,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:21,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 156 transitions, 1458 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:21,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:21,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:21,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:21,786 INFO L124 PetriNetUnfolderBase]: 415/802 cut-off events. [2024-06-03 22:31:21,786 INFO L125 PetriNetUnfolderBase]: For 46159/46159 co-relation queries the response was YES. [2024-06-03 22:31:21,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4835 conditions, 802 events. 415/802 cut-off events. For 46159/46159 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4115 event pairs, 69 based on Foata normal form. 2/804 useless extension candidates. Maximal degree in co-relation 4739. Up to 598 conditions per place. [2024-06-03 22:31:21,793 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 140 selfloop transitions, 37 changer transitions 0/179 dead transitions. [2024-06-03 22:31:21,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 179 transitions, 1910 flow [2024-06-03 22:31:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:31:21,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:31:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 146 transitions. [2024-06-03 22:31:21,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36228287841191065 [2024-06-03 22:31:21,795 INFO L175 Difference]: Start difference. First operand has 208 places, 156 transitions, 1458 flow. Second operand 13 states and 146 transitions. [2024-06-03 22:31:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 179 transitions, 1910 flow [2024-06-03 22:31:21,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 179 transitions, 1832 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:21,898 INFO L231 Difference]: Finished difference. Result has 206 places, 159 transitions, 1496 flow [2024-06-03 22:31:21,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1496, PETRI_PLACES=206, PETRI_TRANSITIONS=159} [2024-06-03 22:31:21,898 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-03 22:31:21,898 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 159 transitions, 1496 flow [2024-06-03 22:31:21,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:21,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:21,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:21,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-03 22:31:21,899 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:21,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:21,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1033985918, now seen corresponding path program 20 times [2024-06-03 22:31:21,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:21,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313583969] [2024-06-03 22:31:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:21,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:21,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:27,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:27,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313583969] [2024-06-03 22:31:27,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313583969] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:27,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:27,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:31:27,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337859903] [2024-06-03 22:31:27,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:31:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:31:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:31:27,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:27,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 159 transitions, 1496 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:27,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:27,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:27,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:28,106 INFO L124 PetriNetUnfolderBase]: 427/829 cut-off events. [2024-06-03 22:31:28,106 INFO L125 PetriNetUnfolderBase]: For 55297/55297 co-relation queries the response was YES. [2024-06-03 22:31:28,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 829 events. 427/829 cut-off events. For 55297/55297 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4306 event pairs, 66 based on Foata normal form. 8/837 useless extension candidates. Maximal degree in co-relation 4830. Up to 503 conditions per place. [2024-06-03 22:31:28,115 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 140 selfloop transitions, 38 changer transitions 7/187 dead transitions. [2024-06-03 22:31:28,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 187 transitions, 2118 flow [2024-06-03 22:31:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2024-06-03 22:31:28,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-06-03 22:31:28,117 INFO L175 Difference]: Start difference. First operand has 206 places, 159 transitions, 1496 flow. Second operand 11 states and 143 transitions. [2024-06-03 22:31:28,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 187 transitions, 2118 flow [2024-06-03 22:31:28,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 187 transitions, 2036 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:31:28,216 INFO L231 Difference]: Finished difference. Result has 208 places, 157 transitions, 1472 flow [2024-06-03 22:31:28,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1472, PETRI_PLACES=208, PETRI_TRANSITIONS=157} [2024-06-03 22:31:28,216 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:31:28,217 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 157 transitions, 1472 flow [2024-06-03 22:31:28,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:28,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:28,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:28,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-03 22:31:28,217 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:28,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1894234314, now seen corresponding path program 2 times [2024-06-03 22:31:28,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280054551] [2024-06-03 22:31:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:34,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:34,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:34,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280054551] [2024-06-03 22:31:34,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280054551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:34,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:34,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:31:34,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121880920] [2024-06-03 22:31:34,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:34,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:31:34,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:34,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:31:34,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:31:34,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:34,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 157 transitions, 1472 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:34,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:34,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:34,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:35,015 INFO L124 PetriNetUnfolderBase]: 413/799 cut-off events. [2024-06-03 22:31:35,015 INFO L125 PetriNetUnfolderBase]: For 46171/46171 co-relation queries the response was YES. [2024-06-03 22:31:35,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 799 events. 413/799 cut-off events. For 46171/46171 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4103 event pairs, 73 based on Foata normal form. 2/801 useless extension candidates. Maximal degree in co-relation 4729. Up to 596 conditions per place. [2024-06-03 22:31:35,022 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 35 changer transitions 0/175 dead transitions. [2024-06-03 22:31:35,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 175 transitions, 1888 flow [2024-06-03 22:31:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:31:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:31:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-03 22:31:35,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2024-06-03 22:31:35,024 INFO L175 Difference]: Start difference. First operand has 208 places, 157 transitions, 1472 flow. Second operand 10 states and 122 transitions. [2024-06-03 22:31:35,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 175 transitions, 1888 flow [2024-06-03 22:31:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 175 transitions, 1792 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:35,121 INFO L231 Difference]: Finished difference. Result has 206 places, 158 transitions, 1464 flow [2024-06-03 22:31:35,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1464, PETRI_PLACES=206, PETRI_TRANSITIONS=158} [2024-06-03 22:31:35,121 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 176 predicate places. [2024-06-03 22:31:35,121 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 158 transitions, 1464 flow [2024-06-03 22:31:35,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:35,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:35,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:35,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-03 22:31:35,122 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:35,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2066963214, now seen corresponding path program 3 times [2024-06-03 22:31:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055178777] [2024-06-03 22:31:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:35,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:41,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:41,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055178777] [2024-06-03 22:31:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055178777] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:41,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:41,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:41,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095428893] [2024-06-03 22:31:41,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:41,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:41,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:41,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:41,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:41,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 158 transitions, 1464 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:41,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:41,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:41,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:42,348 INFO L124 PetriNetUnfolderBase]: 424/821 cut-off events. [2024-06-03 22:31:42,348 INFO L125 PetriNetUnfolderBase]: For 50122/50122 co-relation queries the response was YES. [2024-06-03 22:31:42,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5009 conditions, 821 events. 424/821 cut-off events. For 50122/50122 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4245 event pairs, 68 based on Foata normal form. 2/823 useless extension candidates. Maximal degree in co-relation 4913. Up to 588 conditions per place. [2024-06-03 22:31:42,354 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 138 selfloop transitions, 41 changer transitions 0/181 dead transitions. [2024-06-03 22:31:42,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 181 transitions, 2036 flow [2024-06-03 22:31:42,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-03 22:31:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-03 22:31:42,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 148 transitions. [2024-06-03 22:31:42,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36724565756823824 [2024-06-03 22:31:42,355 INFO L175 Difference]: Start difference. First operand has 206 places, 158 transitions, 1464 flow. Second operand 13 states and 148 transitions. [2024-06-03 22:31:42,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 181 transitions, 2036 flow [2024-06-03 22:31:42,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 181 transitions, 1914 flow, removed 8 selfloop flow, removed 11 redundant places. [2024-06-03 22:31:42,470 INFO L231 Difference]: Finished difference. Result has 208 places, 160 transitions, 1458 flow [2024-06-03 22:31:42,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1458, PETRI_PLACES=208, PETRI_TRANSITIONS=160} [2024-06-03 22:31:42,471 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 178 predicate places. [2024-06-03 22:31:42,471 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 160 transitions, 1458 flow [2024-06-03 22:31:42,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:42,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:42,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:42,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-03 22:31:42,472 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:42,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1323890470, now seen corresponding path program 4 times [2024-06-03 22:31:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699393275] [2024-06-03 22:31:42,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:42,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:31:49,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:49,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699393275] [2024-06-03 22:31:49,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699393275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:49,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:49,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:31:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622977630] [2024-06-03 22:31:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:31:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:31:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-03 22:31:49,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:49,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 160 transitions, 1458 flow. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:49,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:49,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:49,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:50,118 INFO L124 PetriNetUnfolderBase]: 421/816 cut-off events. [2024-06-03 22:31:50,119 INFO L125 PetriNetUnfolderBase]: For 47596/47596 co-relation queries the response was YES. [2024-06-03 22:31:50,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4844 conditions, 816 events. 421/816 cut-off events. For 47596/47596 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4230 event pairs, 68 based on Foata normal form. 2/818 useless extension candidates. Maximal degree in co-relation 4750. Up to 595 conditions per place. [2024-06-03 22:31:50,125 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 137 selfloop transitions, 39 changer transitions 0/178 dead transitions. [2024-06-03 22:31:50,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 178 transitions, 1872 flow [2024-06-03 22:31:50,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-03 22:31:50,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:31:50,126 INFO L175 Difference]: Start difference. First operand has 208 places, 160 transitions, 1458 flow. Second operand 11 states and 132 transitions. [2024-06-03 22:31:50,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 178 transitions, 1872 flow [2024-06-03 22:31:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 178 transitions, 1801 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-03 22:31:50,230 INFO L231 Difference]: Finished difference. Result has 210 places, 160 transitions, 1469 flow [2024-06-03 22:31:50,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1469, PETRI_PLACES=210, PETRI_TRANSITIONS=160} [2024-06-03 22:31:50,230 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 180 predicate places. [2024-06-03 22:31:50,231 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 160 transitions, 1469 flow [2024-06-03 22:31:50,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:50,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:50,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:50,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-03 22:31:50,231 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:50,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:50,232 INFO L85 PathProgramCache]: Analyzing trace with hash 2094768658, now seen corresponding path program 21 times [2024-06-03 22:31:50,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976378153] [2024-06-03 22:31:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:31:55,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-03 22:31:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:31:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976378153] [2024-06-03 22:31:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976378153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:31:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:31:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:31:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964213939] [2024-06-03 22:31:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:31:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:31:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:31:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:31:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:31:56,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:31:56,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 160 transitions, 1469 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:56,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:31:56,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:31:56,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:31:56,499 INFO L124 PetriNetUnfolderBase]: 408/792 cut-off events. [2024-06-03 22:31:56,499 INFO L125 PetriNetUnfolderBase]: For 44956/44956 co-relation queries the response was YES. [2024-06-03 22:31:56,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4180 conditions, 792 events. 408/792 cut-off events. For 44956/44956 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4119 event pairs, 54 based on Foata normal form. 10/802 useless extension candidates. Maximal degree in co-relation 4084. Up to 544 conditions per place. [2024-06-03 22:31:56,506 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 136 selfloop transitions, 32 changer transitions 13/183 dead transitions. [2024-06-03 22:31:56,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 183 transitions, 1933 flow [2024-06-03 22:31:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-03 22:31:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-03 22:31:56,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 136 transitions. [2024-06-03 22:31:56,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39882697947214074 [2024-06-03 22:31:56,507 INFO L175 Difference]: Start difference. First operand has 210 places, 160 transitions, 1469 flow. Second operand 11 states and 136 transitions. [2024-06-03 22:31:56,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 183 transitions, 1933 flow [2024-06-03 22:31:56,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 183 transitions, 1846 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-03 22:31:56,591 INFO L231 Difference]: Finished difference. Result has 211 places, 156 transitions, 1405 flow [2024-06-03 22:31:56,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1405, PETRI_PLACES=211, PETRI_TRANSITIONS=156} [2024-06-03 22:31:56,592 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2024-06-03 22:31:56,592 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 156 transitions, 1405 flow [2024-06-03 22:31:56,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:31:56,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:31:56,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:31:56,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-03 22:31:56,593 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:31:56,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:31:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1721317622, now seen corresponding path program 22 times [2024-06-03 22:31:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:31:56,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889451213] [2024-06-03 22:31:56,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:31:56,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:31:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889451213] [2024-06-03 22:32:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889451213] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:02,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957605271] [2024-06-03 22:32:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:02,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:02,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:02,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:02,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 156 transitions, 1405 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:02,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:02,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:02,533 INFO L124 PetriNetUnfolderBase]: 417/816 cut-off events. [2024-06-03 22:32:02,533 INFO L125 PetriNetUnfolderBase]: For 58403/58403 co-relation queries the response was YES. [2024-06-03 22:32:02,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4713 conditions, 816 events. 417/816 cut-off events. For 58403/58403 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4210 event pairs, 71 based on Foata normal form. 8/824 useless extension candidates. Maximal degree in co-relation 4616. Up to 251 conditions per place. [2024-06-03 22:32:02,539 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 52 changer transitions 13/180 dead transitions. [2024-06-03 22:32:02,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 180 transitions, 1995 flow [2024-06-03 22:32:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:02,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:32:02,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:32:02,540 INFO L175 Difference]: Start difference. First operand has 211 places, 156 transitions, 1405 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:32:02,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 180 transitions, 1995 flow [2024-06-03 22:32:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 180 transitions, 1902 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-03 22:32:02,628 INFO L231 Difference]: Finished difference. Result has 203 places, 153 transitions, 1404 flow [2024-06-03 22:32:02,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1404, PETRI_PLACES=203, PETRI_TRANSITIONS=153} [2024-06-03 22:32:02,628 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 173 predicate places. [2024-06-03 22:32:02,629 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 153 transitions, 1404 flow [2024-06-03 22:32:02,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:02,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:02,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:02,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-03 22:32:02,629 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:02,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1779410072, now seen corresponding path program 23 times [2024-06-03 22:32:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551969373] [2024-06-03 22:32:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551969373] [2024-06-03 22:32:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551969373] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100380843] [2024-06-03 22:32:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:07,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:07,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:07,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:07,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:07,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:07,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 153 transitions, 1404 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:07,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:07,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:07,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:08,105 INFO L124 PetriNetUnfolderBase]: 434/855 cut-off events. [2024-06-03 22:32:08,105 INFO L125 PetriNetUnfolderBase]: For 78677/78677 co-relation queries the response was YES. [2024-06-03 22:32:08,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5494 conditions, 855 events. 434/855 cut-off events. For 78677/78677 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4452 event pairs, 82 based on Foata normal form. 8/863 useless extension candidates. Maximal degree in co-relation 5399. Up to 450 conditions per place. [2024-06-03 22:32:08,113 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 113 selfloop transitions, 52 changer transitions 11/178 dead transitions. [2024-06-03 22:32:08,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 178 transitions, 2000 flow [2024-06-03 22:32:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:08,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 22:32:08,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-03 22:32:08,114 INFO L175 Difference]: Start difference. First operand has 203 places, 153 transitions, 1404 flow. Second operand 10 states and 128 transitions. [2024-06-03 22:32:08,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 178 transitions, 2000 flow [2024-06-03 22:32:08,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 178 transitions, 1907 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:32:08,252 INFO L231 Difference]: Finished difference. Result has 200 places, 150 transitions, 1407 flow [2024-06-03 22:32:08,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1407, PETRI_PLACES=200, PETRI_TRANSITIONS=150} [2024-06-03 22:32:08,252 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 170 predicate places. [2024-06-03 22:32:08,252 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 150 transitions, 1407 flow [2024-06-03 22:32:08,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:08,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:08,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:08,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-03 22:32:08,254 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:08,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:08,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1779525392, now seen corresponding path program 24 times [2024-06-03 22:32:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160805972] [2024-06-03 22:32:08,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:08,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160805972] [2024-06-03 22:32:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160805972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908077397] [2024-06-03 22:32:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:13,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:13,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:13,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 150 transitions, 1407 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:13,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:13,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:14,058 INFO L124 PetriNetUnfolderBase]: 424/837 cut-off events. [2024-06-03 22:32:14,059 INFO L125 PetriNetUnfolderBase]: For 73887/73887 co-relation queries the response was YES. [2024-06-03 22:32:14,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 837 events. 424/837 cut-off events. For 73887/73887 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4337 event pairs, 77 based on Foata normal form. 8/845 useless extension candidates. Maximal degree in co-relation 5338. Up to 433 conditions per place. [2024-06-03 22:32:14,066 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 55 changer transitions 8/174 dead transitions. [2024-06-03 22:32:14,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 174 transitions, 1987 flow [2024-06-03 22:32:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-03 22:32:14,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064516129032258 [2024-06-03 22:32:14,067 INFO L175 Difference]: Start difference. First operand has 200 places, 150 transitions, 1407 flow. Second operand 10 states and 126 transitions. [2024-06-03 22:32:14,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 174 transitions, 1987 flow [2024-06-03 22:32:14,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 174 transitions, 1874 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:14,188 INFO L231 Difference]: Finished difference. Result has 197 places, 148 transitions, 1399 flow [2024-06-03 22:32:14,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1399, PETRI_PLACES=197, PETRI_TRANSITIONS=148} [2024-06-03 22:32:14,193 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 167 predicate places. [2024-06-03 22:32:14,194 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 148 transitions, 1399 flow [2024-06-03 22:32:14,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:14,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:14,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:14,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-03 22:32:14,196 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:14,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1779530042, now seen corresponding path program 25 times [2024-06-03 22:32:14,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:14,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319602589] [2024-06-03 22:32:14,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:19,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319602589] [2024-06-03 22:32:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319602589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:19,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:19,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:19,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637215403] [2024-06-03 22:32:19,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:19,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:19,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:19,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:19,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:20,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:20,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 148 transitions, 1399 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:20,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:20,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:20,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:20,369 INFO L124 PetriNetUnfolderBase]: 393/776 cut-off events. [2024-06-03 22:32:20,369 INFO L125 PetriNetUnfolderBase]: For 55108/55108 co-relation queries the response was YES. [2024-06-03 22:32:20,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4581 conditions, 776 events. 393/776 cut-off events. For 55108/55108 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3968 event pairs, 67 based on Foata normal form. 10/786 useless extension candidates. Maximal degree in co-relation 4490. Up to 450 conditions per place. [2024-06-03 22:32:20,375 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 100 selfloop transitions, 48 changer transitions 17/167 dead transitions. [2024-06-03 22:32:20,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 167 transitions, 1811 flow [2024-06-03 22:32:20,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-03 22:32:20,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38387096774193546 [2024-06-03 22:32:20,377 INFO L175 Difference]: Start difference. First operand has 197 places, 148 transitions, 1399 flow. Second operand 10 states and 119 transitions. [2024-06-03 22:32:20,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 167 transitions, 1811 flow [2024-06-03 22:32:20,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 167 transitions, 1699 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:20,471 INFO L231 Difference]: Finished difference. Result has 196 places, 143 transitions, 1351 flow [2024-06-03 22:32:20,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1351, PETRI_PLACES=196, PETRI_TRANSITIONS=143} [2024-06-03 22:32:20,477 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 166 predicate places. [2024-06-03 22:32:20,477 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 143 transitions, 1351 flow [2024-06-03 22:32:20,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:20,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:20,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:20,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-03 22:32:20,478 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:20,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:20,479 INFO L85 PathProgramCache]: Analyzing trace with hash 176477506, now seen corresponding path program 26 times [2024-06-03 22:32:20,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399937315] [2024-06-03 22:32:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399937315] [2024-06-03 22:32:26,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399937315] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:26,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:26,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:26,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465683958] [2024-06-03 22:32:26,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:26,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:26,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:26,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:26,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:26,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:26,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 143 transitions, 1351 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:26,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:26,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:26,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:26,876 INFO L124 PetriNetUnfolderBase]: 383/758 cut-off events. [2024-06-03 22:32:26,876 INFO L125 PetriNetUnfolderBase]: For 53268/53268 co-relation queries the response was YES. [2024-06-03 22:32:26,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4468 conditions, 758 events. 383/758 cut-off events. For 53268/53268 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3830 event pairs, 61 based on Foata normal form. 10/768 useless extension candidates. Maximal degree in co-relation 4378. Up to 509 conditions per place. [2024-06-03 22:32:26,882 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 108 selfloop transitions, 39 changer transitions 12/161 dead transitions. [2024-06-03 22:32:26,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 161 transitions, 1747 flow [2024-06-03 22:32:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:26,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:32:26,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:32:26,883 INFO L175 Difference]: Start difference. First operand has 196 places, 143 transitions, 1351 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:32:26,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 161 transitions, 1747 flow [2024-06-03 22:32:26,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 161 transitions, 1643 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:26,964 INFO L231 Difference]: Finished difference. Result has 188 places, 140 transitions, 1309 flow [2024-06-03 22:32:26,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1309, PETRI_PLACES=188, PETRI_TRANSITIONS=140} [2024-06-03 22:32:26,965 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 158 predicate places. [2024-06-03 22:32:26,966 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 140 transitions, 1309 flow [2024-06-03 22:32:26,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:26,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:26,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:26,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-03 22:32:26,966 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:26,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:26,966 INFO L85 PathProgramCache]: Analyzing trace with hash 476132904, now seen corresponding path program 27 times [2024-06-03 22:32:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:26,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957906327] [2024-06-03 22:32:26,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:32,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957906327] [2024-06-03 22:32:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957906327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072455534] [2024-06-03 22:32:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:32,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:32,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:32,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:32,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:32,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 140 transitions, 1309 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:32,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:32,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:32,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:32,830 INFO L124 PetriNetUnfolderBase]: 371/738 cut-off events. [2024-06-03 22:32:32,831 INFO L125 PetriNetUnfolderBase]: For 44934/44934 co-relation queries the response was YES. [2024-06-03 22:32:32,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4300 conditions, 738 events. 371/738 cut-off events. For 44934/44934 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3719 event pairs, 57 based on Foata normal form. 8/746 useless extension candidates. Maximal degree in co-relation 4213. Up to 499 conditions per place. [2024-06-03 22:32:32,837 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 106 selfloop transitions, 37 changer transitions 12/157 dead transitions. [2024-06-03 22:32:32,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 157 transitions, 1685 flow [2024-06-03 22:32:32,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2024-06-03 22:32:32,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3774193548387097 [2024-06-03 22:32:32,839 INFO L175 Difference]: Start difference. First operand has 188 places, 140 transitions, 1309 flow. Second operand 10 states and 117 transitions. [2024-06-03 22:32:32,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 157 transitions, 1685 flow [2024-06-03 22:32:32,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 157 transitions, 1603 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:32,919 INFO L231 Difference]: Finished difference. Result has 186 places, 137 transitions, 1275 flow [2024-06-03 22:32:32,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1275, PETRI_PLACES=186, PETRI_TRANSITIONS=137} [2024-06-03 22:32:32,920 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2024-06-03 22:32:32,920 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 137 transitions, 1275 flow [2024-06-03 22:32:32,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:32,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:32,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-03 22:32:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-03 22:32:32,921 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:32,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:32,921 INFO L85 PathProgramCache]: Analyzing trace with hash 171888886, now seen corresponding path program 28 times [2024-06-03 22:32:32,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:32,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435918478] [2024-06-03 22:32:32,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:32,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:38,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:38,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435918478] [2024-06-03 22:32:38,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435918478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:38,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:38,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576226122] [2024-06-03 22:32:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:38,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:38,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:38,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:38,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:38,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:38,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 137 transitions, 1275 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:38,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:38,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:38,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:38,878 INFO L124 PetriNetUnfolderBase]: 393/784 cut-off events. [2024-06-03 22:32:38,878 INFO L125 PetriNetUnfolderBase]: For 58357/58357 co-relation queries the response was YES. [2024-06-03 22:32:38,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4965 conditions, 784 events. 393/784 cut-off events. For 58357/58357 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3987 event pairs, 74 based on Foata normal form. 8/792 useless extension candidates. Maximal degree in co-relation 4879. Up to 453 conditions per place. [2024-06-03 22:32:38,884 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 110 selfloop transitions, 38 changer transitions 11/161 dead transitions. [2024-06-03 22:32:38,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 161 transitions, 1813 flow [2024-06-03 22:32:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-03 22:32:38,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096774193548387 [2024-06-03 22:32:38,885 INFO L175 Difference]: Start difference. First operand has 186 places, 137 transitions, 1275 flow. Second operand 10 states and 127 transitions. [2024-06-03 22:32:38,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 161 transitions, 1813 flow [2024-06-03 22:32:38,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 161 transitions, 1727 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:38,970 INFO L231 Difference]: Finished difference. Result has 182 places, 134 transitions, 1255 flow [2024-06-03 22:32:38,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1255, PETRI_PLACES=182, PETRI_TRANSITIONS=134} [2024-06-03 22:32:38,970 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 152 predicate places. [2024-06-03 22:32:38,970 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 134 transitions, 1255 flow [2024-06-03 22:32:38,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:38,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:38,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:38,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-03 22:32:38,971 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:38,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:38,971 INFO L85 PathProgramCache]: Analyzing trace with hash -701736474, now seen corresponding path program 29 times [2024-06-03 22:32:38,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:38,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331194554] [2024-06-03 22:32:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:38,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:44,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:44,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331194554] [2024-06-03 22:32:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331194554] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:44,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:44,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:44,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41021319] [2024-06-03 22:32:44,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:44,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:44,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:44,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:44,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:44,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:44,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 134 transitions, 1255 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:44,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:44,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:44,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:45,023 INFO L124 PetriNetUnfolderBase]: 383/766 cut-off events. [2024-06-03 22:32:45,023 INFO L125 PetriNetUnfolderBase]: For 54339/54339 co-relation queries the response was YES. [2024-06-03 22:32:45,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 766 events. 383/766 cut-off events. For 54339/54339 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3879 event pairs, 68 based on Foata normal form. 8/774 useless extension candidates. Maximal degree in co-relation 4763. Up to 453 conditions per place. [2024-06-03 22:32:45,029 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 109 selfloop transitions, 38 changer transitions 8/157 dead transitions. [2024-06-03 22:32:45,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 157 transitions, 1779 flow [2024-06-03 22:32:45,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:45,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:45,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:32:45,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:32:45,030 INFO L175 Difference]: Start difference. First operand has 182 places, 134 transitions, 1255 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:32:45,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 157 transitions, 1779 flow [2024-06-03 22:32:45,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 157 transitions, 1694 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:45,107 INFO L231 Difference]: Finished difference. Result has 179 places, 132 transitions, 1241 flow [2024-06-03 22:32:45,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1241, PETRI_PLACES=179, PETRI_TRANSITIONS=132} [2024-06-03 22:32:45,107 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 149 predicate places. [2024-06-03 22:32:45,108 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 132 transitions, 1241 flow [2024-06-03 22:32:45,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:45,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:45,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:45,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-03 22:32:45,108 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:45,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash -197475474, now seen corresponding path program 30 times [2024-06-03 22:32:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35758471] [2024-06-03 22:32:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:50,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:50,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35758471] [2024-06-03 22:32:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35758471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903010178] [2024-06-03 22:32:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:50,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:50,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:50,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 132 transitions, 1241 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:50,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:50,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:50,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:50,641 INFO L124 PetriNetUnfolderBase]: 352/705 cut-off events. [2024-06-03 22:32:50,641 INFO L125 PetriNetUnfolderBase]: For 40162/40162 co-relation queries the response was YES. [2024-06-03 22:32:50,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4081 conditions, 705 events. 352/705 cut-off events. For 40162/40162 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3502 event pairs, 61 based on Foata normal form. 10/715 useless extension candidates. Maximal degree in co-relation 3999. Up to 427 conditions per place. [2024-06-03 22:32:50,646 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 91 selfloop transitions, 41 changer transitions 16/150 dead transitions. [2024-06-03 22:32:50,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 150 transitions, 1615 flow [2024-06-03 22:32:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:50,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:32:50,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:32:50,647 INFO L175 Difference]: Start difference. First operand has 179 places, 132 transitions, 1241 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:32:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 150 transitions, 1615 flow [2024-06-03 22:32:50,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 150 transitions, 1537 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:50,712 INFO L231 Difference]: Finished difference. Result has 178 places, 127 transitions, 1204 flow [2024-06-03 22:32:50,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1204, PETRI_PLACES=178, PETRI_TRANSITIONS=127} [2024-06-03 22:32:50,713 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 148 predicate places. [2024-06-03 22:32:50,713 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 127 transitions, 1204 flow [2024-06-03 22:32:50,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:50,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:50,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:50,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-03 22:32:50,714 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:50,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:50,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1469183528, now seen corresponding path program 31 times [2024-06-03 22:32:50,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:50,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281415084] [2024-06-03 22:32:50,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:50,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:32:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:32:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:32:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281415084] [2024-06-03 22:32:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281415084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:32:56,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:32:56,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:32:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118687629] [2024-06-03 22:32:56,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:32:56,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:32:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:32:56,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:32:56,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:32:56,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:32:56,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 127 transitions, 1204 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:56,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:32:56,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:32:56,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:32:56,962 INFO L124 PetriNetUnfolderBase]: 338/678 cut-off events. [2024-06-03 22:32:56,962 INFO L125 PetriNetUnfolderBase]: For 36143/36143 co-relation queries the response was YES. [2024-06-03 22:32:56,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 678 events. 338/678 cut-off events. For 36143/36143 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3348 event pairs, 42 based on Foata normal form. 8/686 useless extension candidates. Maximal degree in co-relation 3866. Up to 216 conditions per place. [2024-06-03 22:32:56,967 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 83 selfloop transitions, 58 changer transitions 12/155 dead transitions. [2024-06-03 22:32:56,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 155 transitions, 1737 flow [2024-06-03 22:32:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:32:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:32:56,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-03 22:32:56,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4129032258064516 [2024-06-03 22:32:56,968 INFO L175 Difference]: Start difference. First operand has 178 places, 127 transitions, 1204 flow. Second operand 10 states and 128 transitions. [2024-06-03 22:32:56,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 155 transitions, 1737 flow [2024-06-03 22:32:57,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 155 transitions, 1639 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-03 22:32:57,024 INFO L231 Difference]: Finished difference. Result has 170 places, 124 transitions, 1214 flow [2024-06-03 22:32:57,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1214, PETRI_PLACES=170, PETRI_TRANSITIONS=124} [2024-06-03 22:32:57,024 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2024-06-03 22:32:57,024 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 124 transitions, 1214 flow [2024-06-03 22:32:57,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:32:57,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:32:57,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:32:57,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-03 22:32:57,025 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:32:57,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:32:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash -702326470, now seen corresponding path program 32 times [2024-06-03 22:32:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:32:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759647956] [2024-06-03 22:32:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:32:57,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:32:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:03,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:03,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:03,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759647956] [2024-06-03 22:33:03,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759647956] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:03,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:03,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:03,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760970054] [2024-06-03 22:33:03,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:03,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:03,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:03,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:03,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:03,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:33:03,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 124 transitions, 1214 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:03,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:03,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:33:03,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:03,634 INFO L124 PetriNetUnfolderBase]: 328/658 cut-off events. [2024-06-03 22:33:03,635 INFO L125 PetriNetUnfolderBase]: For 34379/34379 co-relation queries the response was YES. [2024-06-03 22:33:03,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3874 conditions, 658 events. 328/658 cut-off events. For 34379/34379 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3220 event pairs, 53 based on Foata normal form. 10/668 useless extension candidates. Maximal degree in co-relation 3796. Up to 366 conditions per place. [2024-06-03 22:33:03,639 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 53 changer transitions 12/146 dead transitions. [2024-06-03 22:33:03,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 146 transitions, 1601 flow [2024-06-03 22:33:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:03,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-03 22:33:03,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-03 22:33:03,640 INFO L175 Difference]: Start difference. First operand has 170 places, 124 transitions, 1214 flow. Second operand 10 states and 124 transitions. [2024-06-03 22:33:03,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 146 transitions, 1601 flow [2024-06-03 22:33:03,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 146 transitions, 1494 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-03 22:33:03,690 INFO L231 Difference]: Finished difference. Result has 167 places, 121 transitions, 1195 flow [2024-06-03 22:33:03,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1107, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1195, PETRI_PLACES=167, PETRI_TRANSITIONS=121} [2024-06-03 22:33:03,690 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 137 predicate places. [2024-06-03 22:33:03,691 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 121 transitions, 1195 flow [2024-06-03 22:33:03,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:03,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:03,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:03,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-03 22:33:03,691 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:03,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash -702331120, now seen corresponding path program 33 times [2024-06-03 22:33:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:03,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216794207] [2024-06-03 22:33:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:08,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216794207] [2024-06-03 22:33:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216794207] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273076291] [2024-06-03 22:33:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:08,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:08,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:08,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:08,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:33:08,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 121 transitions, 1195 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:08,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:08,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:33:08,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:09,296 INFO L124 PetriNetUnfolderBase]: 312/626 cut-off events. [2024-06-03 22:33:09,297 INFO L125 PetriNetUnfolderBase]: For 25719/25719 co-relation queries the response was YES. [2024-06-03 22:33:09,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3750 conditions, 626 events. 312/626 cut-off events. For 25719/25719 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3026 event pairs, 35 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 3674. Up to 360 conditions per place. [2024-06-03 22:33:09,301 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 83 selfloop transitions, 55 changer transitions 1/141 dead transitions. [2024-06-03 22:33:09,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 141 transitions, 1558 flow [2024-06-03 22:33:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-03 22:33:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-03 22:33:09,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-03 22:33:09,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-06-03 22:33:09,302 INFO L175 Difference]: Start difference. First operand has 167 places, 121 transitions, 1195 flow. Second operand 10 states and 120 transitions. [2024-06-03 22:33:09,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 141 transitions, 1558 flow [2024-06-03 22:33:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 141 transitions, 1448 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-03 22:33:09,352 INFO L231 Difference]: Finished difference. Result has 165 places, 122 transitions, 1219 flow [2024-06-03 22:33:09,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1219, PETRI_PLACES=165, PETRI_TRANSITIONS=122} [2024-06-03 22:33:09,368 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2024-06-03 22:33:09,368 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 122 transitions, 1219 flow [2024-06-03 22:33:09,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:09,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:09,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:09,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-03 22:33:09,369 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:09,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:09,369 INFO L85 PathProgramCache]: Analyzing trace with hash -524957366, now seen corresponding path program 5 times [2024-06-03 22:33:09,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:09,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150486979] [2024-06-03 22:33:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:09,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:14,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:14,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:14,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150486979] [2024-06-03 22:33:14,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150486979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:14,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:14,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-03 22:33:14,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208102128] [2024-06-03 22:33:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:14,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-03 22:33:14,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:14,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-03 22:33:14,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-03 22:33:14,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 31 [2024-06-03 22:33:14,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 122 transitions, 1219 flow. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:14,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 22:33:14,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 31 [2024-06-03 22:33:14,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 22:33:15,311 INFO L124 PetriNetUnfolderBase]: 318/641 cut-off events. [2024-06-03 22:33:15,311 INFO L125 PetriNetUnfolderBase]: For 22846/22846 co-relation queries the response was YES. [2024-06-03 22:33:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 641 events. 318/641 cut-off events. For 22846/22846 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3114 event pairs, 53 based on Foata normal form. 2/643 useless extension candidates. Maximal degree in co-relation 3755. Up to 410 conditions per place. [2024-06-03 22:33:15,316 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 93 selfloop transitions, 46 changer transitions 1/142 dead transitions. [2024-06-03 22:33:15,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 142 transitions, 1594 flow [2024-06-03 22:33:15,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-03 22:33:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-03 22:33:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 132 transitions. [2024-06-03 22:33:15,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2024-06-03 22:33:15,318 INFO L175 Difference]: Start difference. First operand has 165 places, 122 transitions, 1219 flow. Second operand 12 states and 132 transitions. [2024-06-03 22:33:15,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 142 transitions, 1594 flow [2024-06-03 22:33:15,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 142 transitions, 1468 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-03 22:33:15,365 INFO L231 Difference]: Finished difference. Result has 170 places, 125 transitions, 1241 flow [2024-06-03 22:33:15,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1241, PETRI_PLACES=170, PETRI_TRANSITIONS=125} [2024-06-03 22:33:15,366 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 140 predicate places. [2024-06-03 22:33:15,366 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 125 transitions, 1241 flow [2024-06-03 22:33:15,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 22:33:15,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 22:33:15,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 22:33:15,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-03 22:33:15,367 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 22:33:15,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 22:33:15,367 INFO L85 PathProgramCache]: Analyzing trace with hash -524948996, now seen corresponding path program 6 times [2024-06-03 22:33:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 22:33:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422428421] [2024-06-03 22:33:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 22:33:15,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 22:33:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 22:33:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 22:33:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 22:33:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422428421] [2024-06-03 22:33:20,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422428421] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 22:33:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 22:33:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-03 22:33:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117154317] [2024-06-03 22:33:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 22:33:20,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-03 22:33:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 22:33:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-03 22:33:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 Killed by 15