./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 76401ed0 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/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-76401ed-m [2024-06-20 19:35:21,167 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 19:35:21,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 19:35:21,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 19:35:21,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 19:35:21,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 19:35:21,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 19:35:21,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 19:35:21,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 19:35:21,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 19:35:21,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 19:35:21,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 19:35:21,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 19:35:21,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 19:35:21,296 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 19:35:21,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 19:35:21,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 19:35:21,297 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 19:35:21,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 19:35:21,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 19:35:21,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 19:35:21,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 19:35:21,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 19:35:21,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 19:35:21,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 19:35:21,300 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 19:35:21,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 19:35:21,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 19:35:21,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 19:35:21,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 19:35:21,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 19:35:21,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 19:35:21,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:35:21,303 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 19:35:21,303 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 19:35:21,303 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 19:35:21,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 19:35:21,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 19:35:21,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 19:35:21,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 19:35:21,305 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 19:35:21,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 19:35:21,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 19:35:21,305 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-20 19:35:21,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 19:35:21,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 19:35:21,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 19:35:21,581 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 19:35:21,582 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 19:35:21,583 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-20 19:35:21,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 19:35:21,750 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 19:35:21,751 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-20 19:35:22,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 19:35:23,237 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 19:35:23,246 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-20 19:35:23,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5f31440/4a6f3a1d93b042dba233205cd525ff67/FLAGabb0c6535 [2024-06-20 19:35:23,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b5f31440/4a6f3a1d93b042dba233205cd525ff67 [2024-06-20 19:35:23,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 19:35:23,286 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 19:35:23,289 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 19:35:23,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 19:35:23,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 19:35:23,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:35:21" (1/2) ... [2024-06-20 19:35:23,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719b047c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:35:23, skipping insertion in model container [2024-06-20 19:35:23,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:35:21" (1/2) ... [2024-06-20 19:35:23,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4757de8e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 07:35:23, skipping insertion in model container [2024-06-20 19:35:23,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:35:23" (2/2) ... [2024-06-20 19:35:23,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719b047c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:23, skipping insertion in model container [2024-06-20 19:35:23,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 07:35:23" (2/2) ... [2024-06-20 19:35:23,301 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 19:35:23,367 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 19:35:23,368 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-20 19:35:23,369 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-20 19:35:23,370 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 19:35:23,370 INFO L106 edCorrectnessWitness]: ghost_update [L811-L811] multithreaded = 1; [2024-06-20 19:35:23,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 19:35:23,744 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:35:23,752 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 19:35:24,114 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 19:35:24,163 INFO L206 MainTranslator]: Completed translation [2024-06-20 19:35:24,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24 WrapperNode [2024-06-20 19:35:24,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 19:35:24,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 19:35:24,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 19:35:24,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 19:35:24,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,286 INFO L138 Inliner]: procedures = 174, calls = 36, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 113 [2024-06-20 19:35:24,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 19:35:24,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 19:35:24,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 19:35:24,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 19:35:24,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-20 19:35:24,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,385 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 19:35:24,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 19:35:24,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 19:35:24,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 19:35:24,418 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (1/1) ... [2024-06-20 19:35:24,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 19:35:24,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 19:35:24,450 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-20 19:35:24,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-20 19:35:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 19:35:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 19:35:24,495 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 19:35:24,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 19:35:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 19:35:24,496 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 19:35:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 19:35:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 19:35:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 19:35:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 19:35:24,498 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 19:35:24,637 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 19:35:24,639 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 19:35:25,596 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 19:35:25,596 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 19:35:25,837 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 19:35:25,837 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 19:35:25,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:35:25 BoogieIcfgContainer [2024-06-20 19:35:25,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 19:35:25,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 19:35:25,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 19:35:25,861 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 19:35:25,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 07:35:21" (1/4) ... [2024-06-20 19:35:25,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b75ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 07:35:25, skipping insertion in model container [2024-06-20 19:35:25,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 07:35:23" (2/4) ... [2024-06-20 19:35:25,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b75ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:35:25, skipping insertion in model container [2024-06-20 19:35:25,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 07:35:24" (3/4) ... [2024-06-20 19:35:25,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b75ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 07:35:25, skipping insertion in model container [2024-06-20 19:35:25,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 07:35:25" (4/4) ... [2024-06-20 19:35:25,869 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-20 19:35:25,885 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 19:35:25,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 19:35:25,886 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 19:35:25,977 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 19:35:26,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 30 transitions, 68 flow [2024-06-20 19:35:26,064 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-06-20 19:35:26,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:35:26,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 19:35:26,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 30 transitions, 68 flow [2024-06-20 19:35:26,069 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 50 flow [2024-06-20 19:35:26,077 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 19:35:26,086 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;@13c8fd1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 19:35:26,086 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 19:35:26,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 19:35:26,098 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 19:35:26,098 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 19:35:26,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:26,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 19:35:26,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:26,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:26,106 INFO L85 PathProgramCache]: Analyzing trace with hash 325944614, now seen corresponding path program 1 times [2024-06-20 19:35:26,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:26,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980662889] [2024-06-20 19:35:26,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:30,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:30,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:30,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980662889] [2024-06-20 19:35:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980662889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 19:35:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445059571] [2024-06-20 19:35:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:30,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 19:35:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 19:35:31,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 19:35:31,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-06-20 19:35:31,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:31,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:31,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-06-20 19:35:31,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:31,377 INFO L124 PetriNetUnfolderBase]: 162/306 cut-off events. [2024-06-20 19:35:31,377 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-20 19:35:31,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 306 events. 162/306 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1107 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-20 19:35:31,385 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 21 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2024-06-20 19:35:31,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 113 flow [2024-06-20 19:35:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 19:35:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 19:35:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-20 19:35:31,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-20 19:35:31,399 INFO L175 Difference]: Start difference. First operand has 29 places, 22 transitions, 50 flow. Second operand 3 states and 53 transitions. [2024-06-20 19:35:31,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 113 flow [2024-06-20 19:35:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 19:35:31,404 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 69 flow [2024-06-20 19:35:31,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2024-06-20 19:35:31,410 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-06-20 19:35:31,410 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 69 flow [2024-06-20 19:35:31,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:31,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:31,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:31,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 19:35:31,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:31,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -299804411, now seen corresponding path program 1 times [2024-06-20 19:35:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15580941] [2024-06-20 19:35:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:34,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-20 19:35:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15580941] [2024-06-20 19:35:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15580941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:34,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:34,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 19:35:34,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296741420] [2024-06-20 19:35:34,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:34,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 19:35:34,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:34,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 19:35:34,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 19:35:34,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-06-20 19:35:34,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:34,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:34,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-06-20 19:35:34,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:35,223 INFO L124 PetriNetUnfolderBase]: 159/303 cut-off events. [2024-06-20 19:35:35,224 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-06-20 19:35:35,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 303 events. 159/303 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1097 event pairs, 79 based on Foata normal form. 2/304 useless extension candidates. Maximal degree in co-relation 679. Up to 274 conditions per place. [2024-06-20 19:35:35,230 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 25 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2024-06-20 19:35:35,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 155 flow [2024-06-20 19:35:35,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 19:35:35,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 19:35:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-06-20 19:35:35,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-20 19:35:35,235 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 69 flow. Second operand 4 states and 68 transitions. [2024-06-20 19:35:35,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 155 flow [2024-06-20 19:35:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 19:35:35,239 INFO L231 Difference]: Finished difference. Result has 33 places, 26 transitions, 93 flow [2024-06-20 19:35:35,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=26} [2024-06-20 19:35:35,240 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2024-06-20 19:35:35,241 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 93 flow [2024-06-20 19:35:35,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:35,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:35,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:35,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 19:35:35,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:35,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash -704001021, now seen corresponding path program 1 times [2024-06-20 19:35:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:35,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006720951] [2024-06-20 19:35:35,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:35,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:38,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:38,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006720951] [2024-06-20 19:35:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006720951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:38,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 19:35:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688861221] [2024-06-20 19:35:38,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:38,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 19:35:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 19:35:38,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 19:35:38,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-20 19:35:38,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-20 19:35:38,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:38,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-20 19:35:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:38,702 INFO L124 PetriNetUnfolderBase]: 187/338 cut-off events. [2024-06-20 19:35:38,702 INFO L125 PetriNetUnfolderBase]: For 197/197 co-relation queries the response was YES. [2024-06-20 19:35:38,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 338 events. 187/338 cut-off events. For 197/197 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1201 event pairs, 67 based on Foata normal form. 3/340 useless extension candidates. Maximal degree in co-relation 852. Up to 293 conditions per place. [2024-06-20 19:35:38,705 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 34 selfloop transitions, 11 changer transitions 0/48 dead transitions. [2024-06-20 19:35:38,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 249 flow [2024-06-20 19:35:38,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:35:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:35:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2024-06-20 19:35:38,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-06-20 19:35:38,710 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 93 flow. Second operand 5 states and 85 transitions. [2024-06-20 19:35:38,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 48 transitions, 249 flow [2024-06-20 19:35:38,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 48 transitions, 240 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 19:35:38,712 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 160 flow [2024-06-20 19:35:38,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-20 19:35:38,714 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-06-20 19:35:38,714 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 160 flow [2024-06-20 19:35:38,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-20 19:35:38,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:38,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:38,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 19:35:38,715 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:38,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:38,716 INFO L85 PathProgramCache]: Analyzing trace with hash -210665862, now seen corresponding path program 1 times [2024-06-20 19:35:38,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:38,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566972239] [2024-06-20 19:35:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:41,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:41,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566972239] [2024-06-20 19:35:41,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566972239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:41,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:41,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:35:41,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987460581] [2024-06-20 19:35:41,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:41,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:35:41,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:41,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:35:41,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:35:42,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-20 19:35:42,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:42,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:42,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-20 19:35:42,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:42,426 INFO L124 PetriNetUnfolderBase]: 188/340 cut-off events. [2024-06-20 19:35:42,427 INFO L125 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2024-06-20 19:35:42,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 340 events. 188/340 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1187 event pairs, 46 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 1026. Up to 282 conditions per place. [2024-06-20 19:35:42,432 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 38 selfloop transitions, 14 changer transitions 0/55 dead transitions. [2024-06-20 19:35:42,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 334 flow [2024-06-20 19:35:42,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:35:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:35:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2024-06-20 19:35:42,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-20 19:35:42,436 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 160 flow. Second operand 6 states and 100 transitions. [2024-06-20 19:35:42,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 334 flow [2024-06-20 19:35:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 330 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-20 19:35:42,443 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 212 flow [2024-06-20 19:35:42,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2024-06-20 19:35:42,445 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 15 predicate places. [2024-06-20 19:35:42,445 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 212 flow [2024-06-20 19:35:42,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:42,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:42,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:42,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 19:35:42,446 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:42,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:42,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2059888706, now seen corresponding path program 1 times [2024-06-20 19:35:42,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:42,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299256608] [2024-06-20 19:35:42,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:42,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:45,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-20 19:35:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299256608] [2024-06-20 19:35:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299256608] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:35:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281589887] [2024-06-20 19:35:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:35:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:35:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:35:45,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-20 19:35:45,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:45,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:45,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-20 19:35:45,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:46,307 INFO L124 PetriNetUnfolderBase]: 189/343 cut-off events. [2024-06-20 19:35:46,307 INFO L125 PetriNetUnfolderBase]: For 640/640 co-relation queries the response was YES. [2024-06-20 19:35:46,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 343 events. 189/343 cut-off events. For 640/640 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1206 event pairs, 24 based on Foata normal form. 6/348 useless extension candidates. Maximal degree in co-relation 1156. Up to 259 conditions per place. [2024-06-20 19:35:46,310 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 38 selfloop transitions, 16 changer transitions 0/57 dead transitions. [2024-06-20 19:35:46,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 57 transitions, 380 flow [2024-06-20 19:35:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:35:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:35:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-20 19:35:46,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-20 19:35:46,313 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 212 flow. Second operand 7 states and 110 transitions. [2024-06-20 19:35:46,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 57 transitions, 380 flow [2024-06-20 19:35:46,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 348 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-20 19:35:46,318 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 215 flow [2024-06-20 19:35:46,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=215, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-06-20 19:35:46,325 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-20 19:35:46,325 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 215 flow [2024-06-20 19:35:46,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:46,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:46,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:46,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:35:46,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:46,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1384917533, now seen corresponding path program 1 times [2024-06-20 19:35:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782186653] [2024-06-20 19:35:46,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:46,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:52,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:52,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782186653] [2024-06-20 19:35:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782186653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:52,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:35:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651027060] [2024-06-20 19:35:52,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:52,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:35:52,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:35:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:35:52,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:35:52,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:52,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:52,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:35:52,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:52,819 INFO L124 PetriNetUnfolderBase]: 187/340 cut-off events. [2024-06-20 19:35:52,820 INFO L125 PetriNetUnfolderBase]: For 747/747 co-relation queries the response was YES. [2024-06-20 19:35:52,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 340 events. 187/340 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1200 event pairs, 47 based on Foata normal form. 1/340 useless extension candidates. Maximal degree in co-relation 1202. Up to 329 conditions per place. [2024-06-20 19:35:52,824 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 34 selfloop transitions, 6 changer transitions 0/42 dead transitions. [2024-06-20 19:35:52,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 307 flow [2024-06-20 19:35:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:35:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:35:52,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2024-06-20 19:35:52,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2024-06-20 19:35:52,825 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 215 flow. Second operand 5 states and 59 transitions. [2024-06-20 19:35:52,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 307 flow [2024-06-20 19:35:52,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 266 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:35:52,829 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 191 flow [2024-06-20 19:35:52,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-06-20 19:35:52,832 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2024-06-20 19:35:52,832 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 191 flow [2024-06-20 19:35:52,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:52,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:52,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:52,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:35:52,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:52,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash -17632073, now seen corresponding path program 1 times [2024-06-20 19:35:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:52,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370653474] [2024-06-20 19:35:52,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:52,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:35:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:35:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:35:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370653474] [2024-06-20 19:35:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370653474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:35:59,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:35:59,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:35:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427875508] [2024-06-20 19:35:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:35:59,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:35:59,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:35:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:35:59,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:35:59,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:35:59,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:59,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:35:59,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:35:59,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:35:59,659 INFO L124 PetriNetUnfolderBase]: 181/331 cut-off events. [2024-06-20 19:35:59,660 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2024-06-20 19:35:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1152 conditions, 331 events. 181/331 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1146 event pairs, 44 based on Foata normal form. 3/333 useless extension candidates. Maximal degree in co-relation 1128. Up to 311 conditions per place. [2024-06-20 19:35:59,662 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 37 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2024-06-20 19:35:59,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 307 flow [2024-06-20 19:35:59,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:35:59,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:35:59,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2024-06-20 19:35:59,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-20 19:35:59,664 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 191 flow. Second operand 6 states and 70 transitions. [2024-06-20 19:35:59,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 307 flow [2024-06-20 19:35:59,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 292 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-20 19:35:59,667 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 209 flow [2024-06-20 19:35:59,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2024-06-20 19:35:59,668 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-06-20 19:35:59,668 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 209 flow [2024-06-20 19:35:59,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:35:59,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:35:59,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:35:59,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:35:59,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:35:59,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:35:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1376822006, now seen corresponding path program 1 times [2024-06-20 19:35:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:35:59,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561921909] [2024-06-20 19:35:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:35:59,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:35:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:03,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:03,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:03,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561921909] [2024-06-20 19:36:03,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561921909] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:03,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:03,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:36:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719490663] [2024-06-20 19:36:03,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:36:03,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:36:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:36:03,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:03,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 209 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:03,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:03,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:03,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:03,865 INFO L124 PetriNetUnfolderBase]: 182/333 cut-off events. [2024-06-20 19:36:03,865 INFO L125 PetriNetUnfolderBase]: For 1009/1009 co-relation queries the response was YES. [2024-06-20 19:36:03,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 333 events. 182/333 cut-off events. For 1009/1009 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1146 event pairs, 43 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 1200. Up to 288 conditions per place. [2024-06-20 19:36:03,867 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 36 selfloop transitions, 13 changer transitions 0/51 dead transitions. [2024-06-20 19:36:03,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 358 flow [2024-06-20 19:36:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:36:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:36:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-06-20 19:36:03,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-20 19:36:03,873 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 209 flow. Second operand 6 states and 76 transitions. [2024-06-20 19:36:03,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 358 flow [2024-06-20 19:36:03,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 341 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:36:03,875 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 240 flow [2024-06-20 19:36:03,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-20 19:36:03,876 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-06-20 19:36:03,876 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 240 flow [2024-06-20 19:36:03,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:03,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:03,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:03,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:36:03,877 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:03,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:03,877 INFO L85 PathProgramCache]: Analyzing trace with hash -534088964, now seen corresponding path program 2 times [2024-06-20 19:36:03,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:03,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698198285] [2024-06-20 19:36:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:03,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:07,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:07,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698198285] [2024-06-20 19:36:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698198285] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:07,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:36:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006060471] [2024-06-20 19:36:07,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:07,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:36:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:36:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:36:08,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:08,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:08,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:08,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:08,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:08,290 INFO L124 PetriNetUnfolderBase]: 177/323 cut-off events. [2024-06-20 19:36:08,290 INFO L125 PetriNetUnfolderBase]: For 1164/1164 co-relation queries the response was YES. [2024-06-20 19:36:08,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1226 conditions, 323 events. 177/323 cut-off events. For 1164/1164 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1094 event pairs, 42 based on Foata normal form. 1/323 useless extension candidates. Maximal degree in co-relation 1201. Up to 309 conditions per place. [2024-06-20 19:36:08,292 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 37 selfloop transitions, 8 changer transitions 0/47 dead transitions. [2024-06-20 19:36:08,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 344 flow [2024-06-20 19:36:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:36:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:36:08,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2024-06-20 19:36:08,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2024-06-20 19:36:08,294 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 240 flow. Second operand 6 states and 68 transitions. [2024-06-20 19:36:08,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 344 flow [2024-06-20 19:36:08,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 329 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-20 19:36:08,297 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 246 flow [2024-06-20 19:36:08,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-06-20 19:36:08,298 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2024-06-20 19:36:08,298 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 246 flow [2024-06-20 19:36:08,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:08,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:08,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:36:08,299 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-20 19:36:08,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash 268191758, now seen corresponding path program 1 times [2024-06-20 19:36:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092598067] [2024-06-20 19:36:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:12,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092598067] [2024-06-20 19:36:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092598067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:12,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:36:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732748681] [2024-06-20 19:36:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:36:12,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:36:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:36:12,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:12,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 246 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:12,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:12,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:12,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:13,050 INFO L124 PetriNetUnfolderBase]: 215/385 cut-off events. [2024-06-20 19:36:13,050 INFO L125 PetriNetUnfolderBase]: For 1805/1805 co-relation queries the response was YES. [2024-06-20 19:36:13,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 385 events. 215/385 cut-off events. For 1805/1805 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1393 event pairs, 48 based on Foata normal form. 6/390 useless extension candidates. Maximal degree in co-relation 1435. Up to 276 conditions per place. [2024-06-20 19:36:13,053 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 45 selfloop transitions, 17 changer transitions 0/64 dead transitions. [2024-06-20 19:36:13,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 456 flow [2024-06-20 19:36:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:36:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:36:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-06-20 19:36:13,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-06-20 19:36:13,055 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 246 flow. Second operand 7 states and 92 transitions. [2024-06-20 19:36:13,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 456 flow [2024-06-20 19:36:13,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 64 transitions, 422 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:13,059 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 295 flow [2024-06-20 19:36:13,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-20 19:36:13,061 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 26 predicate places. [2024-06-20 19:36:13,061 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 295 flow [2024-06-20 19:36:13,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:13,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:13,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:13,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:36:13,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:13,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash 623112284, now seen corresponding path program 2 times [2024-06-20 19:36:13,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:13,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990574319] [2024-06-20 19:36:13,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:17,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:17,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990574319] [2024-06-20 19:36:17,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990574319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:17,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:17,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:36:17,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753636614] [2024-06-20 19:36:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:17,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:36:17,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:17,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:36:17,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:36:17,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:17,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 295 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:17,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:17,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:17,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:17,960 INFO L124 PetriNetUnfolderBase]: 224/400 cut-off events. [2024-06-20 19:36:17,960 INFO L125 PetriNetUnfolderBase]: For 2141/2141 co-relation queries the response was YES. [2024-06-20 19:36:17,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 400 events. 224/400 cut-off events. For 2141/2141 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1446 event pairs, 48 based on Foata normal form. 3/402 useless extension candidates. Maximal degree in co-relation 1647. Up to 360 conditions per place. [2024-06-20 19:36:17,966 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2024-06-20 19:36:17,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 64 transitions, 497 flow [2024-06-20 19:36:17,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:36:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:36:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2024-06-20 19:36:17,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:36:17,967 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 295 flow. Second operand 7 states and 84 transitions. [2024-06-20 19:36:17,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 64 transitions, 497 flow [2024-06-20 19:36:17,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 64 transitions, 482 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-20 19:36:17,974 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 343 flow [2024-06-20 19:36:17,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=343, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2024-06-20 19:36:17,975 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2024-06-20 19:36:17,975 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 343 flow [2024-06-20 19:36:17,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:17,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:17,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:17,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:36:17,976 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:17,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:17,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1955003612, now seen corresponding path program 3 times [2024-06-20 19:36:17,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414911267] [2024-06-20 19:36:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:17,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:22,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414911267] [2024-06-20 19:36:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414911267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:36:22,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057063056] [2024-06-20 19:36:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:22,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:36:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:36:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:36:22,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:22,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 343 flow. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:22,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:22,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:22,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:22,617 INFO L124 PetriNetUnfolderBase]: 218/391 cut-off events. [2024-06-20 19:36:22,618 INFO L125 PetriNetUnfolderBase]: For 2396/2396 co-relation queries the response was YES. [2024-06-20 19:36:22,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 391 events. 218/391 cut-off events. For 2396/2396 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1413 event pairs, 50 based on Foata normal form. 3/393 useless extension candidates. Maximal degree in co-relation 1648. Up to 368 conditions per place. [2024-06-20 19:36:22,621 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 49 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2024-06-20 19:36:22,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 483 flow [2024-06-20 19:36:22,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:36:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:36:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2024-06-20 19:36:22,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3761904761904762 [2024-06-20 19:36:22,622 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 343 flow. Second operand 7 states and 79 transitions. [2024-06-20 19:36:22,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 483 flow [2024-06-20 19:36:22,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 459 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-20 19:36:22,627 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 344 flow [2024-06-20 19:36:22,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=344, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-06-20 19:36:22,628 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-20 19:36:22,628 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 344 flow [2024-06-20 19:36:22,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 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-20 19:36:22,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:22,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:22,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:36:22,629 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:22,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:22,629 INFO L85 PathProgramCache]: Analyzing trace with hash -279804311, now seen corresponding path program 1 times [2024-06-20 19:36:22,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:22,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950950520] [2024-06-20 19:36:22,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:22,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:28,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:28,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950950520] [2024-06-20 19:36:28,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950950520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:28,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:28,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:36:28,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336541468] [2024-06-20 19:36:28,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:28,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:36:28,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:28,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:36:28,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:36:28,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:28,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 344 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-20 19:36:28,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:28,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:28,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:28,428 INFO L124 PetriNetUnfolderBase]: 216/388 cut-off events. [2024-06-20 19:36:28,428 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2024-06-20 19:36:28,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1686 conditions, 388 events. 216/388 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1401 event pairs, 50 based on Foata normal form. 1/388 useless extension candidates. Maximal degree in co-relation 1654. Up to 328 conditions per place. [2024-06-20 19:36:28,431 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 48 selfloop transitions, 18 changer transitions 0/68 dead transitions. [2024-06-20 19:36:28,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 522 flow [2024-06-20 19:36:28,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:28,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 97 transitions. [2024-06-20 19:36:28,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4041666666666667 [2024-06-20 19:36:28,433 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 344 flow. Second operand 8 states and 97 transitions. [2024-06-20 19:36:28,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 522 flow [2024-06-20 19:36:28,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 496 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:28,438 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 376 flow [2024-06-20 19:36:28,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=376, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-20 19:36:28,439 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 37 predicate places. [2024-06-20 19:36:28,439 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 376 flow [2024-06-20 19:36:28,439 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-20 19:36:28,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:28,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:28,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:36:28,440 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:28,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash -275989296, now seen corresponding path program 1 times [2024-06-20 19:36:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:28,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950854290] [2024-06-20 19:36:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:28,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950854290] [2024-06-20 19:36:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950854290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:32,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:32,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:32,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477115429] [2024-06-20 19:36:32,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:32,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:32,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:32,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:32,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:32,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:32,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 376 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:32,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:32,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:32,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:33,283 INFO L124 PetriNetUnfolderBase]: 225/403 cut-off events. [2024-06-20 19:36:33,283 INFO L125 PetriNetUnfolderBase]: For 3034/3034 co-relation queries the response was YES. [2024-06-20 19:36:33,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 403 events. 225/403 cut-off events. For 3034/3034 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1472 event pairs, 47 based on Foata normal form. 3/405 useless extension candidates. Maximal degree in co-relation 1775. Up to 282 conditions per place. [2024-06-20 19:36:33,287 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 51 selfloop transitions, 21 changer transitions 0/74 dead transitions. [2024-06-20 19:36:33,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 74 transitions, 606 flow [2024-06-20 19:36:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 19:36:33,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-06-20 19:36:33,288 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 376 flow. Second operand 8 states and 103 transitions. [2024-06-20 19:36:33,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 74 transitions, 606 flow [2024-06-20 19:36:33,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 74 transitions, 566 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:33,295 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 397 flow [2024-06-20 19:36:33,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=397, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2024-06-20 19:36:33,296 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 39 predicate places. [2024-06-20 19:36:33,296 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 397 flow [2024-06-20 19:36:33,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:33,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:33,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:33,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:36:33,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:33,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:33,298 INFO L85 PathProgramCache]: Analyzing trace with hash -275994876, now seen corresponding path program 2 times [2024-06-20 19:36:33,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:33,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332952612] [2024-06-20 19:36:33,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:33,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:36,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:36,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:36,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332952612] [2024-06-20 19:36:36,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332952612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:36,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:36,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:36:36,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483776717] [2024-06-20 19:36:36,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:36,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:36:36,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:36,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:36:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:36:36,904 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:36,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 397 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-20 19:36:36,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:36,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:36,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:37,257 INFO L124 PetriNetUnfolderBase]: 234/418 cut-off events. [2024-06-20 19:36:37,257 INFO L125 PetriNetUnfolderBase]: For 3602/3602 co-relation queries the response was YES. [2024-06-20 19:36:37,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1924 conditions, 418 events. 234/418 cut-off events. For 3602/3602 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1551 event pairs, 45 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1890. Up to 290 conditions per place. [2024-06-20 19:36:37,261 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 50 selfloop transitions, 26 changer transitions 0/78 dead transitions. [2024-06-20 19:36:37,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 78 transitions, 647 flow [2024-06-20 19:36:37,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:36:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:36:37,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2024-06-20 19:36:37,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-20 19:36:37,263 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 397 flow. Second operand 7 states and 97 transitions. [2024-06-20 19:36:37,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 78 transitions, 647 flow [2024-06-20 19:36:37,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 595 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:37,269 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 420 flow [2024-06-20 19:36:37,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=420, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2024-06-20 19:36:37,270 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-20 19:36:37,270 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 420 flow [2024-06-20 19:36:37,270 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-20 19:36:37,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:37,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:37,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:36:37,271 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:37,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:37,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1463551134, now seen corresponding path program 3 times [2024-06-20 19:36:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:37,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786296640] [2024-06-20 19:36:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:41,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:41,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:41,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786296640] [2024-06-20 19:36:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786296640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:41,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839284572] [2024-06-20 19:36:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:41,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:41,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:41,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 420 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:41,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:41,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:41,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:41,912 INFO L124 PetriNetUnfolderBase]: 243/433 cut-off events. [2024-06-20 19:36:41,913 INFO L125 PetriNetUnfolderBase]: For 4035/4035 co-relation queries the response was YES. [2024-06-20 19:36:41,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 433 events. 243/433 cut-off events. For 4035/4035 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1615 event pairs, 53 based on Foata normal form. 3/435 useless extension candidates. Maximal degree in co-relation 1991. Up to 397 conditions per place. [2024-06-20 19:36:41,917 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 58 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-06-20 19:36:41,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 608 flow [2024-06-20 19:36:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2024-06-20 19:36:41,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-20 19:36:41,918 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 420 flow. Second operand 8 states and 90 transitions. [2024-06-20 19:36:41,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 608 flow [2024-06-20 19:36:41,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 560 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-20 19:36:41,925 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 423 flow [2024-06-20 19:36:41,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=423, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2024-06-20 19:36:41,926 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-20 19:36:41,926 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 423 flow [2024-06-20 19:36:41,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:41,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:41,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:36:41,927 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:41,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:41,927 INFO L85 PathProgramCache]: Analyzing trace with hash 475578283, now seen corresponding path program 1 times [2024-06-20 19:36:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:41,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183285916] [2024-06-20 19:36:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:46,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:46,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183285916] [2024-06-20 19:36:46,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183285916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:46,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:46,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:46,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102544697] [2024-06-20 19:36:46,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:46,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:46,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:46,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:46,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 423 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:46,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:46,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:46,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:46,633 INFO L124 PetriNetUnfolderBase]: 239/427 cut-off events. [2024-06-20 19:36:46,633 INFO L125 PetriNetUnfolderBase]: For 4184/4184 co-relation queries the response was YES. [2024-06-20 19:36:46,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 427 events. 239/427 cut-off events. For 4184/4184 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1589 event pairs, 49 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 1931. Up to 399 conditions per place. [2024-06-20 19:36:46,637 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 58 selfloop transitions, 12 changer transitions 0/72 dead transitions. [2024-06-20 19:36:46,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 601 flow [2024-06-20 19:36:46,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-20 19:36:46,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-20 19:36:46,640 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 423 flow. Second operand 8 states and 88 transitions. [2024-06-20 19:36:46,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 601 flow [2024-06-20 19:36:46,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 72 transitions, 576 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:46,647 INFO L231 Difference]: Finished difference. Result has 75 places, 62 transitions, 447 flow [2024-06-20 19:36:46,648 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=447, PETRI_PLACES=75, PETRI_TRANSITIONS=62} [2024-06-20 19:36:46,648 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2024-06-20 19:36:46,648 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 62 transitions, 447 flow [2024-06-20 19:36:46,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:46,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:46,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:36:46,649 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:46,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 468218976, now seen corresponding path program 4 times [2024-06-20 19:36:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277628114] [2024-06-20 19:36:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:46,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:51,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-20 19:36:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277628114] [2024-06-20 19:36:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277628114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:36:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921701192] [2024-06-20 19:36:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:51,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:36:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:51,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:36:51,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:36:51,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:51,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 62 transitions, 447 flow. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:51,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:51,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:51,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:51,982 INFO L124 PetriNetUnfolderBase]: 233/418 cut-off events. [2024-06-20 19:36:51,982 INFO L125 PetriNetUnfolderBase]: For 4310/4310 co-relation queries the response was YES. [2024-06-20 19:36:51,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 418 events. 233/418 cut-off events. For 4310/4310 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1567 event pairs, 44 based on Foata normal form. 3/420 useless extension candidates. Maximal degree in co-relation 1895. Up to 370 conditions per place. [2024-06-20 19:36:51,985 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 59 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2024-06-20 19:36:51,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 76 transitions, 631 flow [2024-06-20 19:36:51,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:51,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2024-06-20 19:36:51,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39166666666666666 [2024-06-20 19:36:51,986 INFO L175 Difference]: Start difference. First operand has 75 places, 62 transitions, 447 flow. Second operand 8 states and 94 transitions. [2024-06-20 19:36:51,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 76 transitions, 631 flow [2024-06-20 19:36:51,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 593 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:36:51,994 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 444 flow [2024-06-20 19:36:51,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=444, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-06-20 19:36:51,994 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-20 19:36:51,995 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 444 flow [2024-06-20 19:36:51,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:51,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:51,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:51,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:36:51,995 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:51,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:51,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1290067713, now seen corresponding path program 1 times [2024-06-20 19:36:51,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258165988] [2024-06-20 19:36:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:51,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:36:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:36:58,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:36:58,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258165988] [2024-06-20 19:36:58,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258165988] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:36:58,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:36:58,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:36:58,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029316434] [2024-06-20 19:36:58,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:36:58,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:36:58,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:36:58,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:36:58,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:36:58,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:36:58,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 444 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:58,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:36:58,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:36:58,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:36:58,521 INFO L124 PetriNetUnfolderBase]: 230/413 cut-off events. [2024-06-20 19:36:58,522 INFO L125 PetriNetUnfolderBase]: For 4402/4402 co-relation queries the response was YES. [2024-06-20 19:36:58,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 413 events. 230/413 cut-off events. For 4402/4402 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1521 event pairs, 46 based on Foata normal form. 2/414 useless extension candidates. Maximal degree in co-relation 1868. Up to 387 conditions per place. [2024-06-20 19:36:58,526 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 59 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-06-20 19:36:58,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 72 transitions, 606 flow [2024-06-20 19:36:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:36:58,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:36:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 86 transitions. [2024-06-20 19:36:58,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2024-06-20 19:36:58,527 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 444 flow. Second operand 8 states and 86 transitions. [2024-06-20 19:36:58,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 72 transitions, 606 flow [2024-06-20 19:36:58,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 72 transitions, 543 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:36:58,536 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 407 flow [2024-06-20 19:36:58,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=407, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2024-06-20 19:36:58,537 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 48 predicate places. [2024-06-20 19:36:58,537 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 407 flow [2024-06-20 19:36:58,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:36:58,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:36:58,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:36:58,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:36:58,538 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:36:58,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:36:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1208104863, now seen corresponding path program 1 times [2024-06-20 19:36:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:36:58,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311177349] [2024-06-20 19:36:58,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:36:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:36:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:03,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:03,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311177349] [2024-06-20 19:37:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311177349] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:03,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:03,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:03,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550530592] [2024-06-20 19:37:03,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:03,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:03,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:03,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:03,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:04,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:04,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 407 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-20 19:37:04,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:04,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:04,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:04,302 INFO L124 PetriNetUnfolderBase]: 234/421 cut-off events. [2024-06-20 19:37:04,303 INFO L125 PetriNetUnfolderBase]: For 4769/4769 co-relation queries the response was YES. [2024-06-20 19:37:04,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 421 events. 234/421 cut-off events. For 4769/4769 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1567 event pairs, 33 based on Foata normal form. 2/422 useless extension candidates. Maximal degree in co-relation 1865. Up to 320 conditions per place. [2024-06-20 19:37:04,306 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 60 selfloop transitions, 18 changer transitions 0/80 dead transitions. [2024-06-20 19:37:04,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 80 transitions, 651 flow [2024-06-20 19:37:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:04,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:04,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-20 19:37:04,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:37:04,310 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 407 flow. Second operand 8 states and 96 transitions. [2024-06-20 19:37:04,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 80 transitions, 651 flow [2024-06-20 19:37:04,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 80 transitions, 621 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:04,317 INFO L231 Difference]: Finished difference. Result has 78 places, 63 transitions, 427 flow [2024-06-20 19:37:04,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=427, PETRI_PLACES=78, PETRI_TRANSITIONS=63} [2024-06-20 19:37:04,318 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-20 19:37:04,318 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 63 transitions, 427 flow [2024-06-20 19:37:04,319 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-20 19:37:04,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:04,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:37:04,319 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:04,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1208044413, now seen corresponding path program 2 times [2024-06-20 19:37:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:04,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609844155] [2024-06-20 19:37:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:04,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:09,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:09,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609844155] [2024-06-20 19:37:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609844155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:09,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492393732] [2024-06-20 19:37:09,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:09,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:09,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:09,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:09,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:09,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 63 transitions, 427 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-20 19:37:09,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:09,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:09,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:09,936 INFO L124 PetriNetUnfolderBase]: 241/434 cut-off events. [2024-06-20 19:37:09,936 INFO L125 PetriNetUnfolderBase]: For 5292/5292 co-relation queries the response was YES. [2024-06-20 19:37:09,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 434 events. 241/434 cut-off events. For 5292/5292 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1640 event pairs, 50 based on Foata normal form. 2/435 useless extension candidates. Maximal degree in co-relation 1959. Up to 367 conditions per place. [2024-06-20 19:37:09,939 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 61 selfloop transitions, 18 changer transitions 0/81 dead transitions. [2024-06-20 19:37:09,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 81 transitions, 645 flow [2024-06-20 19:37:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:09,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 96 transitions. [2024-06-20 19:37:09,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:37:09,941 INFO L175 Difference]: Start difference. First operand has 78 places, 63 transitions, 427 flow. Second operand 8 states and 96 transitions. [2024-06-20 19:37:09,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 81 transitions, 645 flow [2024-06-20 19:37:09,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 81 transitions, 600 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:09,948 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 448 flow [2024-06-20 19:37:09,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=448, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-06-20 19:37:09,949 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2024-06-20 19:37:09,949 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 448 flow [2024-06-20 19:37:09,949 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-20 19:37:09,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:09,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:09,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:37:09,950 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:09,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -83998065, now seen corresponding path program 1 times [2024-06-20 19:37:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:09,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902442302] [2024-06-20 19:37:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:15,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:15,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902442302] [2024-06-20 19:37:15,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902442302] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:15,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024168334] [2024-06-20 19:37:15,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:15,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:15,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:15,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:15,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 448 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-20 19:37:15,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:15,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:15,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:15,915 INFO L124 PetriNetUnfolderBase]: 244/439 cut-off events. [2024-06-20 19:37:15,916 INFO L125 PetriNetUnfolderBase]: For 5677/5677 co-relation queries the response was YES. [2024-06-20 19:37:15,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 439 events. 244/439 cut-off events. For 5677/5677 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1682 event pairs, 38 based on Foata normal form. 1/439 useless extension candidates. Maximal degree in co-relation 1981. Up to 332 conditions per place. [2024-06-20 19:37:15,919 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 69 selfloop transitions, 23 changer transitions 0/94 dead transitions. [2024-06-20 19:37:15,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 94 transitions, 779 flow [2024-06-20 19:37:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2024-06-20 19:37:15,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2024-06-20 19:37:15,922 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 448 flow. Second operand 8 states and 100 transitions. [2024-06-20 19:37:15,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 94 transitions, 779 flow [2024-06-20 19:37:15,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 94 transitions, 740 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:15,931 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 534 flow [2024-06-20 19:37:15,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=534, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-06-20 19:37:15,932 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 56 predicate places. [2024-06-20 19:37:15,932 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 534 flow [2024-06-20 19:37:15,932 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-20 19:37:15,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:15,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:37:15,933 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:15,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -81196905, now seen corresponding path program 2 times [2024-06-20 19:37:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144967072] [2024-06-20 19:37:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:15,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144967072] [2024-06-20 19:37:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144967072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:21,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:21,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:21,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535506095] [2024-06-20 19:37:21,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:21,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:21,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:21,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:21,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:21,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 534 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-20 19:37:21,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:21,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:21,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:21,862 INFO L124 PetriNetUnfolderBase]: 253/454 cut-off events. [2024-06-20 19:37:21,862 INFO L125 PetriNetUnfolderBase]: For 6711/6711 co-relation queries the response was YES. [2024-06-20 19:37:21,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2172 conditions, 454 events. 253/454 cut-off events. For 6711/6711 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1751 event pairs, 46 based on Foata normal form. 3/456 useless extension candidates. Maximal degree in co-relation 2131. Up to 313 conditions per place. [2024-06-20 19:37:21,865 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 59 selfloop transitions, 34 changer transitions 0/95 dead transitions. [2024-06-20 19:37:21,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 95 transitions, 789 flow [2024-06-20 19:37:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:21,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2024-06-20 19:37:21,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425 [2024-06-20 19:37:21,867 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 534 flow. Second operand 8 states and 102 transitions. [2024-06-20 19:37:21,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 95 transitions, 789 flow [2024-06-20 19:37:21,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 95 transitions, 758 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:37:21,874 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 619 flow [2024-06-20 19:37:21,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=619, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2024-06-20 19:37:21,875 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-20 19:37:21,875 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 619 flow [2024-06-20 19:37:21,875 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-20 19:37:21,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:21,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:21,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:37:21,875 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:21,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:21,876 INFO L85 PathProgramCache]: Analyzing trace with hash -81201555, now seen corresponding path program 3 times [2024-06-20 19:37:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:21,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616136070] [2024-06-20 19:37:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:27,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:27,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616136070] [2024-06-20 19:37:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616136070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140023350] [2024-06-20 19:37:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:27,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:27,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:27,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 619 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-20 19:37:27,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:27,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:27,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:27,395 INFO L124 PetriNetUnfolderBase]: 256/459 cut-off events. [2024-06-20 19:37:27,395 INFO L125 PetriNetUnfolderBase]: For 6868/6868 co-relation queries the response was YES. [2024-06-20 19:37:27,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2304 conditions, 459 events. 256/459 cut-off events. For 6868/6868 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1788 event pairs, 46 based on Foata normal form. 1/459 useless extension candidates. Maximal degree in co-relation 2262. Up to 312 conditions per place. [2024-06-20 19:37:27,399 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 58 selfloop transitions, 37 changer transitions 0/97 dead transitions. [2024-06-20 19:37:27,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 862 flow [2024-06-20 19:37:27,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:27,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 103 transitions. [2024-06-20 19:37:27,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2024-06-20 19:37:27,401 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 619 flow. Second operand 8 states and 103 transitions. [2024-06-20 19:37:27,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 862 flow [2024-06-20 19:37:27,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 786 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:27,412 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 642 flow [2024-06-20 19:37:27,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=642, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2024-06-20 19:37:27,413 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2024-06-20 19:37:27,413 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 642 flow [2024-06-20 19:37:27,413 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-20 19:37:27,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:27,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:27,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:37:27,414 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:27,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash -81201679, now seen corresponding path program 3 times [2024-06-20 19:37:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:27,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247846416] [2024-06-20 19:37:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:32,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247846416] [2024-06-20 19:37:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247846416] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:32,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:32,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:32,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835944237] [2024-06-20 19:37:32,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:32,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:32,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:32,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:32,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:32,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 642 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-20 19:37:32,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:32,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:32,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:32,461 INFO L124 PetriNetUnfolderBase]: 253/454 cut-off events. [2024-06-20 19:37:32,461 INFO L125 PetriNetUnfolderBase]: For 7137/7137 co-relation queries the response was YES. [2024-06-20 19:37:32,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 454 events. 253/454 cut-off events. For 7137/7137 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1758 event pairs, 50 based on Foata normal form. 2/455 useless extension candidates. Maximal degree in co-relation 2221. Up to 402 conditions per place. [2024-06-20 19:37:32,464 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 76 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2024-06-20 19:37:32,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 94 transitions, 854 flow [2024-06-20 19:37:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:32,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:32,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-20 19:37:32,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875 [2024-06-20 19:37:32,474 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 642 flow. Second operand 8 states and 93 transitions. [2024-06-20 19:37:32,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 94 transitions, 854 flow [2024-06-20 19:37:32,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 780 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:32,486 INFO L231 Difference]: Finished difference. Result has 94 places, 82 transitions, 604 flow [2024-06-20 19:37:32,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=604, PETRI_PLACES=94, PETRI_TRANSITIONS=82} [2024-06-20 19:37:32,487 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-20 19:37:32,487 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 82 transitions, 604 flow [2024-06-20 19:37:32,487 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-20 19:37:32,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:32,487 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:32,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:37:32,488 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:32,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:32,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1089956609, now seen corresponding path program 4 times [2024-06-20 19:37:32,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:32,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374668913] [2024-06-20 19:37:32,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:32,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374668913] [2024-06-20 19:37:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374668913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:37,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:37,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975760711] [2024-06-20 19:37:37,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:37,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:37,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:37,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:37,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:37,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 82 transitions, 604 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-20 19:37:37,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:37,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:37,992 INFO L124 PetriNetUnfolderBase]: 266/475 cut-off events. [2024-06-20 19:37:37,992 INFO L125 PetriNetUnfolderBase]: For 7914/7914 co-relation queries the response was YES. [2024-06-20 19:37:37,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2372 conditions, 475 events. 266/475 cut-off events. For 7914/7914 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1872 event pairs, 37 based on Foata normal form. 1/475 useless extension candidates. Maximal degree in co-relation 2328. Up to 297 conditions per place. [2024-06-20 19:37:37,996 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 65 selfloop transitions, 41 changer transitions 0/108 dead transitions. [2024-06-20 19:37:37,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 108 transitions, 961 flow [2024-06-20 19:37:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2024-06-20 19:37:37,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4625 [2024-06-20 19:37:37,998 INFO L175 Difference]: Start difference. First operand has 94 places, 82 transitions, 604 flow. Second operand 8 states and 111 transitions. [2024-06-20 19:37:37,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 108 transitions, 961 flow [2024-06-20 19:37:38,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 108 transitions, 901 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:37:38,009 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 691 flow [2024-06-20 19:37:38,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=691, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-06-20 19:37:38,009 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2024-06-20 19:37:38,009 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 691 flow [2024-06-20 19:37:38,010 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-20 19:37:38,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:38,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:38,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:37:38,010 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:38,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:38,011 INFO L85 PathProgramCache]: Analyzing trace with hash 837696885, now seen corresponding path program 5 times [2024-06-20 19:37:38,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:38,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747686238] [2024-06-20 19:37:38,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:38,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:43,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747686238] [2024-06-20 19:37:43,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747686238] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:43,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:43,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:37:43,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934908339] [2024-06-20 19:37:43,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:43,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:37:43,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:43,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:37:43,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:37:43,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:43,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 691 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:37:43,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:43,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:43,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:44,115 INFO L124 PetriNetUnfolderBase]: 275/490 cut-off events. [2024-06-20 19:37:44,115 INFO L125 PetriNetUnfolderBase]: For 9489/9489 co-relation queries the response was YES. [2024-06-20 19:37:44,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 490 events. 275/490 cut-off events. For 9489/9489 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1945 event pairs, 46 based on Foata normal form. 3/492 useless extension candidates. Maximal degree in co-relation 2544. Up to 349 conditions per place. [2024-06-20 19:37:44,118 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 72 selfloop transitions, 34 changer transitions 0/108 dead transitions. [2024-06-20 19:37:44,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 1001 flow [2024-06-20 19:37:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:44,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:37:44,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-20 19:37:44,120 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 691 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:37:44,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 1001 flow [2024-06-20 19:37:44,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 108 transitions, 918 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:37:44,135 INFO L231 Difference]: Finished difference. Result has 98 places, 90 transitions, 744 flow [2024-06-20 19:37:44,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=744, PETRI_PLACES=98, PETRI_TRANSITIONS=90} [2024-06-20 19:37:44,136 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-06-20 19:37:44,136 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 90 transitions, 744 flow [2024-06-20 19:37:44,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:37:44,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:44,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:44,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:37:44,137 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:44,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 34094265, now seen corresponding path program 6 times [2024-06-20 19:37:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:44,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722425205] [2024-06-20 19:37:44,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722425205] [2024-06-20 19:37:48,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722425205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:37:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216535455] [2024-06-20 19:37:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:48,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:37:48,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:37:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:37:48,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:48,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 90 transitions, 744 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-20 19:37:48,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:48,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:48,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:49,086 INFO L124 PetriNetUnfolderBase]: 284/505 cut-off events. [2024-06-20 19:37:49,086 INFO L125 PetriNetUnfolderBase]: For 10285/10285 co-relation queries the response was YES. [2024-06-20 19:37:49,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 505 events. 284/505 cut-off events. For 10285/10285 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2026 event pairs, 38 based on Foata normal form. 3/507 useless extension candidates. Maximal degree in co-relation 2653. Up to 364 conditions per place. [2024-06-20 19:37:49,091 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 75 selfloop transitions, 37 changer transitions 0/114 dead transitions. [2024-06-20 19:37:49,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 114 transitions, 1074 flow [2024-06-20 19:37:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:37:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:37:49,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2024-06-20 19:37:49,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44583333333333336 [2024-06-20 19:37:49,093 INFO L175 Difference]: Start difference. First operand has 98 places, 90 transitions, 744 flow. Second operand 8 states and 107 transitions. [2024-06-20 19:37:49,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 114 transitions, 1074 flow [2024-06-20 19:37:49,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 114 transitions, 988 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:37:49,112 INFO L231 Difference]: Finished difference. Result has 99 places, 94 transitions, 802 flow [2024-06-20 19:37:49,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=802, PETRI_PLACES=99, PETRI_TRANSITIONS=94} [2024-06-20 19:37:49,118 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 70 predicate places. [2024-06-20 19:37:49,118 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 94 transitions, 802 flow [2024-06-20 19:37:49,118 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-20 19:37:49,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:49,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:37:49,120 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:49,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1816732457, now seen corresponding path program 7 times [2024-06-20 19:37:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130684893] [2024-06-20 19:37:49,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:37:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:37:54,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:37:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130684893] [2024-06-20 19:37:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130684893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:37:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:37:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:37:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748265163] [2024-06-20 19:37:54,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:37:54,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:37:54,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:37:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:37:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:37:55,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:37:55,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 94 transitions, 802 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:37:55,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:37:55,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:37:55,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:37:55,383 INFO L124 PetriNetUnfolderBase]: 293/520 cut-off events. [2024-06-20 19:37:55,383 INFO L125 PetriNetUnfolderBase]: For 11077/11077 co-relation queries the response was YES. [2024-06-20 19:37:55,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2838 conditions, 520 events. 293/520 cut-off events. For 11077/11077 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2100 event pairs, 52 based on Foata normal form. 3/522 useless extension candidates. Maximal degree in co-relation 2790. Up to 473 conditions per place. [2024-06-20 19:37:55,387 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 93 selfloop transitions, 17 changer transitions 0/112 dead transitions. [2024-06-20 19:37:55,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 112 transitions, 1120 flow [2024-06-20 19:37:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:37:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:37:55,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2024-06-20 19:37:55,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37407407407407406 [2024-06-20 19:37:55,388 INFO L175 Difference]: Start difference. First operand has 99 places, 94 transitions, 802 flow. Second operand 9 states and 101 transitions. [2024-06-20 19:37:55,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 112 transitions, 1120 flow [2024-06-20 19:37:55,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 112 transitions, 1020 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-20 19:37:55,403 INFO L231 Difference]: Finished difference. Result has 102 places, 98 transitions, 814 flow [2024-06-20 19:37:55,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=814, PETRI_PLACES=102, PETRI_TRANSITIONS=98} [2024-06-20 19:37:55,404 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-06-20 19:37:55,404 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 98 transitions, 814 flow [2024-06-20 19:37:55,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:37:55,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:37:55,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:37:55,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:37:55,405 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:37:55,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:37:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1629887197, now seen corresponding path program 8 times [2024-06-20 19:37:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:37:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212179411] [2024-06-20 19:37:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:37:55,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:37:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:01,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:01,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212179411] [2024-06-20 19:38:01,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212179411] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:01,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:01,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:01,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348854872] [2024-06-20 19:38:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:01,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:01,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:01,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:01,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 98 transitions, 814 flow. Second operand has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:01,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:01,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:01,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:01,756 INFO L124 PetriNetUnfolderBase]: 290/516 cut-off events. [2024-06-20 19:38:01,756 INFO L125 PetriNetUnfolderBase]: For 10482/10482 co-relation queries the response was YES. [2024-06-20 19:38:01,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2657 conditions, 516 events. 290/516 cut-off events. For 10482/10482 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2077 event pairs, 42 based on Foata normal form. 3/518 useless extension candidates. Maximal degree in co-relation 2608. Up to 448 conditions per place. [2024-06-20 19:38:01,760 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 93 selfloop transitions, 23 changer transitions 0/118 dead transitions. [2024-06-20 19:38:01,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 118 transitions, 1105 flow [2024-06-20 19:38:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-20 19:38:01,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2024-06-20 19:38:01,762 INFO L175 Difference]: Start difference. First operand has 102 places, 98 transitions, 814 flow. Second operand 9 states and 106 transitions. [2024-06-20 19:38:01,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 118 transitions, 1105 flow [2024-06-20 19:38:01,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 1017 flow, removed 30 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:01,781 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 818 flow [2024-06-20 19:38:01,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=818, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-06-20 19:38:01,782 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 77 predicate places. [2024-06-20 19:38:01,782 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 818 flow [2024-06-20 19:38:01,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.3) internal successors, (73), 10 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:01,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:01,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:01,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:38:01,783 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:01,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1559515561, now seen corresponding path program 1 times [2024-06-20 19:38:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:01,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363414668] [2024-06-20 19:38:01,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:01,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363414668] [2024-06-20 19:38:05,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363414668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:05,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:05,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:38:05,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235475597] [2024-06-20 19:38:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:38:05,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:38:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:38:05,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-06-20 19:38:05,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 818 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:05,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:05,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-06-20 19:38:05,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:06,057 INFO L124 PetriNetUnfolderBase]: 291/518 cut-off events. [2024-06-20 19:38:06,057 INFO L125 PetriNetUnfolderBase]: For 10120/10120 co-relation queries the response was YES. [2024-06-20 19:38:06,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 518 events. 291/518 cut-off events. For 10120/10120 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2097 event pairs, 52 based on Foata normal form. 2/519 useless extension candidates. Maximal degree in co-relation 2644. Up to 487 conditions per place. [2024-06-20 19:38:06,061 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 99 selfloop transitions, 13 changer transitions 0/115 dead transitions. [2024-06-20 19:38:06,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 115 transitions, 1086 flow [2024-06-20 19:38:06,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:38:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:38:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2024-06-20 19:38:06,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44166666666666665 [2024-06-20 19:38:06,063 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 818 flow. Second operand 8 states and 106 transitions. [2024-06-20 19:38:06,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 115 transitions, 1086 flow [2024-06-20 19:38:06,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 115 transitions, 1004 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:06,085 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 787 flow [2024-06-20 19:38:06,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=736, 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=787, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2024-06-20 19:38:06,086 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-06-20 19:38:06,086 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 787 flow [2024-06-20 19:38:06,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:38:06,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:06,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:06,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:38:06,087 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:06,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1689150471, now seen corresponding path program 1 times [2024-06-20 19:38:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459905958] [2024-06-20 19:38:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:10,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459905958] [2024-06-20 19:38:10,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459905958] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:10,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:10,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:10,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496591227] [2024-06-20 19:38:10,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:10,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:10,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:10,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:10,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:10,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:10,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 787 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-20 19:38:10,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:10,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:11,324 INFO L124 PetriNetUnfolderBase]: 316/565 cut-off events. [2024-06-20 19:38:11,325 INFO L125 PetriNetUnfolderBase]: For 13709/13709 co-relation queries the response was YES. [2024-06-20 19:38:11,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3017 conditions, 565 events. 316/565 cut-off events. For 13709/13709 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2346 event pairs, 33 based on Foata normal form. 2/566 useless extension candidates. Maximal degree in co-relation 2965. Up to 209 conditions per place. [2024-06-20 19:38:11,329 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 68 selfloop transitions, 60 changer transitions 0/130 dead transitions. [2024-06-20 19:38:11,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 130 transitions, 1193 flow [2024-06-20 19:38:11,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2024-06-20 19:38:11,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42962962962962964 [2024-06-20 19:38:11,331 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 787 flow. Second operand 9 states and 116 transitions. [2024-06-20 19:38:11,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 130 transitions, 1193 flow [2024-06-20 19:38:11,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 130 transitions, 1150 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:11,358 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 927 flow [2024-06-20 19:38:11,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=927, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2024-06-20 19:38:11,359 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-06-20 19:38:11,359 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 927 flow [2024-06-20 19:38:11,360 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-20 19:38:11,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:11,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:11,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:38:11,360 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:11,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 969137389, now seen corresponding path program 2 times [2024-06-20 19:38:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320462059] [2024-06-20 19:38:11,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:18,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320462059] [2024-06-20 19:38:18,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320462059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:18,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:18,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:18,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144188262] [2024-06-20 19:38:18,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:18,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:18,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:18,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:18,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:18,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 107 transitions, 927 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-20 19:38:18,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:18,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:18,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:18,587 INFO L124 PetriNetUnfolderBase]: 327/586 cut-off events. [2024-06-20 19:38:18,587 INFO L125 PetriNetUnfolderBase]: For 15861/15861 co-relation queries the response was YES. [2024-06-20 19:38:18,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 586 events. 327/586 cut-off events. For 15861/15861 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2487 event pairs, 48 based on Foata normal form. 2/587 useless extension candidates. Maximal degree in co-relation 3300. Up to 351 conditions per place. [2024-06-20 19:38:18,590 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 69 selfloop transitions, 58 changer transitions 0/129 dead transitions. [2024-06-20 19:38:18,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 129 transitions, 1309 flow [2024-06-20 19:38:18,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 19:38:18,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-20 19:38:18,592 INFO L175 Difference]: Start difference. First operand has 112 places, 107 transitions, 927 flow. Second operand 9 states and 115 transitions. [2024-06-20 19:38:18,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 129 transitions, 1309 flow [2024-06-20 19:38:18,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 129 transitions, 1198 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:38:18,621 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 952 flow [2024-06-20 19:38:18,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=952, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2024-06-20 19:38:18,621 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-20 19:38:18,621 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 952 flow [2024-06-20 19:38:18,621 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-20 19:38:18,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:18,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:18,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:38:18,622 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:18,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:18,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1691028296, now seen corresponding path program 1 times [2024-06-20 19:38:18,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:18,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126478056] [2024-06-20 19:38:18,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:18,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:23,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:23,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126478056] [2024-06-20 19:38:23,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126478056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:23,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:23,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:23,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763558886] [2024-06-20 19:38:23,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:23,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:23,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:23,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:23,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:24,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:24,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 952 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-20 19:38:24,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:24,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:24,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:24,463 INFO L124 PetriNetUnfolderBase]: 343/612 cut-off events. [2024-06-20 19:38:24,463 INFO L125 PetriNetUnfolderBase]: For 17999/17999 co-relation queries the response was YES. [2024-06-20 19:38:24,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3604 conditions, 612 events. 343/612 cut-off events. For 17999/17999 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2624 event pairs, 50 based on Foata normal form. 2/613 useless extension candidates. Maximal degree in co-relation 3548. Up to 373 conditions per place. [2024-06-20 19:38:24,466 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 77 selfloop transitions, 53 changer transitions 0/132 dead transitions. [2024-06-20 19:38:24,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 1388 flow [2024-06-20 19:38:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:24,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 114 transitions. [2024-06-20 19:38:24,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-06-20 19:38:24,468 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 952 flow. Second operand 9 states and 114 transitions. [2024-06-20 19:38:24,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 1388 flow [2024-06-20 19:38:24,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 132 transitions, 1316 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-20 19:38:24,503 INFO L231 Difference]: Finished difference. Result has 119 places, 113 transitions, 1055 flow [2024-06-20 19:38:24,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1055, PETRI_PLACES=119, PETRI_TRANSITIONS=113} [2024-06-20 19:38:24,504 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 90 predicate places. [2024-06-20 19:38:24,504 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 113 transitions, 1055 flow [2024-06-20 19:38:24,504 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-20 19:38:24,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:24,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:24,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:38:24,504 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:24,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1691028141, now seen corresponding path program 3 times [2024-06-20 19:38:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916456922] [2024-06-20 19:38:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:30,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916456922] [2024-06-20 19:38:30,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916456922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:30,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:30,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:30,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341362550] [2024-06-20 19:38:30,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:30,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:30,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:30,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:30,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:30,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:30,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 113 transitions, 1055 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-20 19:38:30,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:30,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:30,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:30,692 INFO L124 PetriNetUnfolderBase]: 340/607 cut-off events. [2024-06-20 19:38:30,692 INFO L125 PetriNetUnfolderBase]: For 18029/18029 co-relation queries the response was YES. [2024-06-20 19:38:30,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 607 events. 340/607 cut-off events. For 18029/18029 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2590 event pairs, 49 based on Foata normal form. 2/608 useless extension candidates. Maximal degree in co-relation 3619. Up to 389 conditions per place. [2024-06-20 19:38:30,695 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 72 selfloop transitions, 57 changer transitions 0/131 dead transitions. [2024-06-20 19:38:30,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 131 transitions, 1359 flow [2024-06-20 19:38:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:38:30,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2024-06-20 19:38:30,698 INFO L175 Difference]: Start difference. First operand has 119 places, 113 transitions, 1055 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:38:30,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 131 transitions, 1359 flow [2024-06-20 19:38:30,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 131 transitions, 1286 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-20 19:38:30,727 INFO L231 Difference]: Finished difference. Result has 123 places, 113 transitions, 1100 flow [2024-06-20 19:38:30,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1100, PETRI_PLACES=123, PETRI_TRANSITIONS=113} [2024-06-20 19:38:30,727 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2024-06-20 19:38:30,727 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 113 transitions, 1100 flow [2024-06-20 19:38:30,727 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-20 19:38:30,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:30,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:30,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:38:30,728 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:30,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1777864256, now seen corresponding path program 2 times [2024-06-20 19:38:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:30,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559109037] [2024-06-20 19:38:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:35,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-20 19:38:35,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:35,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559109037] [2024-06-20 19:38:35,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559109037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:35,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:35,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968497224] [2024-06-20 19:38:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:35,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:35,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:35,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:35,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 113 transitions, 1100 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-20 19:38:35,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:35,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:35,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:35,827 INFO L124 PetriNetUnfolderBase]: 346/617 cut-off events. [2024-06-20 19:38:35,827 INFO L125 PetriNetUnfolderBase]: For 18903/18903 co-relation queries the response was YES. [2024-06-20 19:38:35,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 617 events. 346/617 cut-off events. For 18903/18903 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2661 event pairs, 45 based on Foata normal form. 2/618 useless extension candidates. Maximal degree in co-relation 3756. Up to 470 conditions per place. [2024-06-20 19:38:35,830 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 94 selfloop transitions, 36 changer transitions 0/132 dead transitions. [2024-06-20 19:38:35,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 132 transitions, 1437 flow [2024-06-20 19:38:35,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:35,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2024-06-20 19:38:35,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2024-06-20 19:38:35,831 INFO L175 Difference]: Start difference. First operand has 123 places, 113 transitions, 1100 flow. Second operand 9 states and 112 transitions. [2024-06-20 19:38:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 132 transitions, 1437 flow [2024-06-20 19:38:35,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 1321 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:38:35,864 INFO L231 Difference]: Finished difference. Result has 124 places, 115 transitions, 1093 flow [2024-06-20 19:38:35,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1093, PETRI_PLACES=124, PETRI_TRANSITIONS=115} [2024-06-20 19:38:35,865 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2024-06-20 19:38:35,866 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 115 transitions, 1093 flow [2024-06-20 19:38:35,866 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-20 19:38:35,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:35,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:35,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:38:35,866 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:35,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:35,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1292169525, now seen corresponding path program 4 times [2024-06-20 19:38:35,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:35,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890516893] [2024-06-20 19:38:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:35,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:41,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:41,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890516893] [2024-06-20 19:38:41,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890516893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:41,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:41,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:41,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634122603] [2024-06-20 19:38:41,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:41,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:41,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:41,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:41,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:41,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 115 transitions, 1093 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-20 19:38:41,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:41,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:41,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:41,939 INFO L124 PetriNetUnfolderBase]: 366/661 cut-off events. [2024-06-20 19:38:41,939 INFO L125 PetriNetUnfolderBase]: For 26305/26305 co-relation queries the response was YES. [2024-06-20 19:38:41,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3944 conditions, 661 events. 366/661 cut-off events. For 26305/26305 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2929 event pairs, 49 based on Foata normal form. 12/672 useless extension candidates. Maximal degree in co-relation 3883. Up to 472 conditions per place. [2024-06-20 19:38:41,943 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 95 selfloop transitions, 32 changer transitions 8/137 dead transitions. [2024-06-20 19:38:41,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 137 transitions, 1444 flow [2024-06-20 19:38:41,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2024-06-20 19:38:41,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2024-06-20 19:38:41,945 INFO L175 Difference]: Start difference. First operand has 124 places, 115 transitions, 1093 flow. Second operand 9 states and 115 transitions. [2024-06-20 19:38:41,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 137 transitions, 1444 flow [2024-06-20 19:38:41,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 137 transitions, 1355 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:41,983 INFO L231 Difference]: Finished difference. Result has 126 places, 113 transitions, 1050 flow [2024-06-20 19:38:41,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1050, PETRI_PLACES=126, PETRI_TRANSITIONS=113} [2024-06-20 19:38:41,983 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 97 predicate places. [2024-06-20 19:38:41,983 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 113 transitions, 1050 flow [2024-06-20 19:38:41,983 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-20 19:38:41,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:41,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:41,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:38:41,984 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:41,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash 432556354, now seen corresponding path program 3 times [2024-06-20 19:38:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816606636] [2024-06-20 19:38:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:41,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:46,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:46,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816606636] [2024-06-20 19:38:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816606636] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437890031] [2024-06-20 19:38:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:47,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:47,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 113 transitions, 1050 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-20 19:38:47,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:47,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:47,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:47,468 INFO L124 PetriNetUnfolderBase]: 346/621 cut-off events. [2024-06-20 19:38:47,468 INFO L125 PetriNetUnfolderBase]: For 21016/21016 co-relation queries the response was YES. [2024-06-20 19:38:47,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 621 events. 346/621 cut-off events. For 21016/21016 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2693 event pairs, 45 based on Foata normal form. 2/622 useless extension candidates. Maximal degree in co-relation 3754. Up to 470 conditions per place. [2024-06-20 19:38:47,472 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 93 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2024-06-20 19:38:47,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 132 transitions, 1391 flow [2024-06-20 19:38:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 113 transitions. [2024-06-20 19:38:47,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4185185185185185 [2024-06-20 19:38:47,473 INFO L175 Difference]: Start difference. First operand has 126 places, 113 transitions, 1050 flow. Second operand 9 states and 113 transitions. [2024-06-20 19:38:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 132 transitions, 1391 flow [2024-06-20 19:38:47,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 132 transitions, 1327 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:47,524 INFO L231 Difference]: Finished difference. Result has 128 places, 115 transitions, 1101 flow [2024-06-20 19:38:47,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1101, PETRI_PLACES=128, PETRI_TRANSITIONS=115} [2024-06-20 19:38:47,524 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2024-06-20 19:38:47,525 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 115 transitions, 1101 flow [2024-06-20 19:38:47,525 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-20 19:38:47,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:47,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:47,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:38:47,525 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:47,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1777719951, now seen corresponding path program 5 times [2024-06-20 19:38:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185246599] [2024-06-20 19:38:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:47,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:47,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:53,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:53,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185246599] [2024-06-20 19:38:53,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185246599] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:53,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:53,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:53,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308362248] [2024-06-20 19:38:53,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:53,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:53,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:53,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:53,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:53,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:53,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 115 transitions, 1101 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-20 19:38:53,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:53,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:53,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:53,574 INFO L124 PetriNetUnfolderBase]: 350/629 cut-off events. [2024-06-20 19:38:53,574 INFO L125 PetriNetUnfolderBase]: For 22164/22164 co-relation queries the response was YES. [2024-06-20 19:38:53,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3895 conditions, 629 events. 350/629 cut-off events. For 22164/22164 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2742 event pairs, 47 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 3832. Up to 484 conditions per place. [2024-06-20 19:38:53,578 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 95 selfloop transitions, 35 changer transitions 0/132 dead transitions. [2024-06-20 19:38:53,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 132 transitions, 1412 flow [2024-06-20 19:38:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 110 transitions. [2024-06-20 19:38:53,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2024-06-20 19:38:53,579 INFO L175 Difference]: Start difference. First operand has 128 places, 115 transitions, 1101 flow. Second operand 9 states and 110 transitions. [2024-06-20 19:38:53,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 132 transitions, 1412 flow [2024-06-20 19:38:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 132 transitions, 1317 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:53,619 INFO L231 Difference]: Finished difference. Result has 130 places, 116 transitions, 1090 flow [2024-06-20 19:38:53,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1090, PETRI_PLACES=130, PETRI_TRANSITIONS=116} [2024-06-20 19:38:53,620 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2024-06-20 19:38:53,620 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 116 transitions, 1090 flow [2024-06-20 19:38:53,620 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-20 19:38:53,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:53,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:53,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:38:53,621 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:53,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1777716231, now seen corresponding path program 6 times [2024-06-20 19:38:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120214891] [2024-06-20 19:38:53,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:38:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:38:58,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:38:58,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120214891] [2024-06-20 19:38:58,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120214891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:38:58,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:38:58,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:38:58,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10823870] [2024-06-20 19:38:58,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:38:58,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:38:58,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:38:58,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:38:58,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:38:58,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:38:58,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 116 transitions, 1090 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-20 19:38:58,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:38:58,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:38:58,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:38:58,680 INFO L124 PetriNetUnfolderBase]: 354/637 cut-off events. [2024-06-20 19:38:58,681 INFO L125 PetriNetUnfolderBase]: For 23177/23177 co-relation queries the response was YES. [2024-06-20 19:38:58,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 637 events. 354/637 cut-off events. For 23177/23177 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 2818 event pairs, 53 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 3861. Up to 472 conditions per place. [2024-06-20 19:38:58,686 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 95 selfloop transitions, 37 changer transitions 0/134 dead transitions. [2024-06-20 19:38:58,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 1409 flow [2024-06-20 19:38:58,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:38:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:38:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2024-06-20 19:38:58,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111111111111111 [2024-06-20 19:38:58,688 INFO L175 Difference]: Start difference. First operand has 130 places, 116 transitions, 1090 flow. Second operand 9 states and 111 transitions. [2024-06-20 19:38:58,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 1409 flow [2024-06-20 19:38:58,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 134 transitions, 1337 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:38:58,752 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 1108 flow [2024-06-20 19:38:58,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1108, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-06-20 19:38:58,753 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 103 predicate places. [2024-06-20 19:38:58,753 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 1108 flow [2024-06-20 19:38:58,753 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-20 19:38:58,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:38:58,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:38:58,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:38:58,754 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:38:58,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:38:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1056775205, now seen corresponding path program 7 times [2024-06-20 19:38:58,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:38:58,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477096004] [2024-06-20 19:38:58,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:38:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:38:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:03,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-20 19:39:03,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:03,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477096004] [2024-06-20 19:39:03,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477096004] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:03,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:03,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:03,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445391614] [2024-06-20 19:39:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:03,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:03,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:03,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 1108 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-20 19:39:03,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:03,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:03,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:04,170 INFO L124 PetriNetUnfolderBase]: 366/665 cut-off events. [2024-06-20 19:39:04,170 INFO L125 PetriNetUnfolderBase]: For 27306/27306 co-relation queries the response was YES. [2024-06-20 19:39:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4203 conditions, 665 events. 366/665 cut-off events. For 27306/27306 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2962 event pairs, 33 based on Foata normal form. 2/666 useless extension candidates. Maximal degree in co-relation 4138. Up to 344 conditions per place. [2024-06-20 19:39:04,174 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 88 selfloop transitions, 55 changer transitions 0/145 dead transitions. [2024-06-20 19:39:04,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 1559 flow [2024-06-20 19:39:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-06-20 19:39:04,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-06-20 19:39:04,175 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 1108 flow. Second operand 9 states and 125 transitions. [2024-06-20 19:39:04,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 1559 flow [2024-06-20 19:39:04,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 145 transitions, 1481 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:04,254 INFO L231 Difference]: Finished difference. Result has 134 places, 118 transitions, 1156 flow [2024-06-20 19:39:04,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1156, PETRI_PLACES=134, PETRI_TRANSITIONS=118} [2024-06-20 19:39:04,255 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2024-06-20 19:39:04,255 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 118 transitions, 1156 flow [2024-06-20 19:39:04,255 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-20 19:39:04,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:04,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:04,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:39:04,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-20 19:39:04,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1056779080, now seen corresponding path program 4 times [2024-06-20 19:39:04,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:04,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699676062] [2024-06-20 19:39:04,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:04,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:04,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:08,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:08,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699676062] [2024-06-20 19:39:08,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699676062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:08,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:08,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:08,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707892165] [2024-06-20 19:39:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:08,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:08,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:08,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:09,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:09,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 118 transitions, 1156 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-20 19:39:09,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:09,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:09,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:09,490 INFO L124 PetriNetUnfolderBase]: 372/675 cut-off events. [2024-06-20 19:39:09,491 INFO L125 PetriNetUnfolderBase]: For 28795/28795 co-relation queries the response was YES. [2024-06-20 19:39:09,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4363 conditions, 675 events. 372/675 cut-off events. For 28795/28795 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3032 event pairs, 51 based on Foata normal form. 2/676 useless extension candidates. Maximal degree in co-relation 4297. Up to 465 conditions per place. [2024-06-20 19:39:09,495 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 90 selfloop transitions, 52 changer transitions 0/144 dead transitions. [2024-06-20 19:39:09,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 144 transitions, 1625 flow [2024-06-20 19:39:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 121 transitions. [2024-06-20 19:39:09,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44814814814814813 [2024-06-20 19:39:09,496 INFO L175 Difference]: Start difference. First operand has 134 places, 118 transitions, 1156 flow. Second operand 9 states and 121 transitions. [2024-06-20 19:39:09,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 144 transitions, 1625 flow [2024-06-20 19:39:09,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 144 transitions, 1488 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:09,562 INFO L231 Difference]: Finished difference. Result has 136 places, 120 transitions, 1164 flow [2024-06-20 19:39:09,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1019, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1164, PETRI_PLACES=136, PETRI_TRANSITIONS=120} [2024-06-20 19:39:09,565 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 107 predicate places. [2024-06-20 19:39:09,565 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 120 transitions, 1164 flow [2024-06-20 19:39:09,565 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-20 19:39:09,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:09,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:09,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:39:09,581 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:09,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1056778925, now seen corresponding path program 8 times [2024-06-20 19:39:09,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:09,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602918998] [2024-06-20 19:39:09,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:09,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:15,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602918998] [2024-06-20 19:39:15,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602918998] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:15,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:15,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:15,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863408955] [2024-06-20 19:39:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:15,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:15,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:15,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:15,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 120 transitions, 1164 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-20 19:39:15,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:15,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:15,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:15,513 INFO L124 PetriNetUnfolderBase]: 376/683 cut-off events. [2024-06-20 19:39:15,513 INFO L125 PetriNetUnfolderBase]: For 30220/30220 co-relation queries the response was YES. [2024-06-20 19:39:15,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4357 conditions, 683 events. 376/683 cut-off events. For 30220/30220 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3089 event pairs, 51 based on Foata normal form. 2/684 useless extension candidates. Maximal degree in co-relation 4291. Up to 488 conditions per place. [2024-06-20 19:39:15,517 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 89 selfloop transitions, 53 changer transitions 0/144 dead transitions. [2024-06-20 19:39:15,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 1522 flow [2024-06-20 19:39:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2024-06-20 19:39:15,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-06-20 19:39:15,518 INFO L175 Difference]: Start difference. First operand has 136 places, 120 transitions, 1164 flow. Second operand 9 states and 119 transitions. [2024-06-20 19:39:15,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 1522 flow [2024-06-20 19:39:15,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 144 transitions, 1382 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:15,564 INFO L231 Difference]: Finished difference. Result has 138 places, 121 transitions, 1147 flow [2024-06-20 19:39:15,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1024, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1147, PETRI_PLACES=138, PETRI_TRANSITIONS=121} [2024-06-20 19:39:15,564 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 109 predicate places. [2024-06-20 19:39:15,565 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 121 transitions, 1147 flow [2024-06-20 19:39:15,565 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-20 19:39:15,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:15,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:15,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:39:15,565 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:15,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1062285610, now seen corresponding path program 5 times [2024-06-20 19:39:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508605888] [2024-06-20 19:39:15,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508605888] [2024-06-20 19:39:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508605888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:20,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165775948] [2024-06-20 19:39:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:20,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:20,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:20,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:20,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 121 transitions, 1147 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:20,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:20,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:20,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:20,707 INFO L124 PetriNetUnfolderBase]: 382/693 cut-off events. [2024-06-20 19:39:20,707 INFO L125 PetriNetUnfolderBase]: For 31690/31690 co-relation queries the response was YES. [2024-06-20 19:39:20,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4422 conditions, 693 events. 382/693 cut-off events. For 31690/31690 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3139 event pairs, 65 based on Foata normal form. 2/694 useless extension candidates. Maximal degree in co-relation 4355. Up to 546 conditions per place. [2024-06-20 19:39:20,711 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 106 selfloop transitions, 35 changer transitions 0/143 dead transitions. [2024-06-20 19:39:20,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 143 transitions, 1525 flow [2024-06-20 19:39:20,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:20,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2024-06-20 19:39:20,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-06-20 19:39:20,712 INFO L175 Difference]: Start difference. First operand has 138 places, 121 transitions, 1147 flow. Second operand 10 states and 123 transitions. [2024-06-20 19:39:20,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 143 transitions, 1525 flow [2024-06-20 19:39:20,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 143 transitions, 1415 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:20,759 INFO L231 Difference]: Finished difference. Result has 141 places, 123 transitions, 1152 flow [2024-06-20 19:39:20,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1152, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2024-06-20 19:39:20,759 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 112 predicate places. [2024-06-20 19:39:20,759 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 1152 flow [2024-06-20 19:39:20,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:20,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:20,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:20,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:39:20,760 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:20,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1056923230, now seen corresponding path program 6 times [2024-06-20 19:39:20,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:20,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029980182] [2024-06-20 19:39:20,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:20,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:25,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029980182] [2024-06-20 19:39:25,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029980182] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:25,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:25,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503882434] [2024-06-20 19:39:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:25,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:25,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:25,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:26,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:26,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 1152 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-20 19:39:26,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:26,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:26,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:26,445 INFO L124 PetriNetUnfolderBase]: 388/703 cut-off events. [2024-06-20 19:39:26,445 INFO L125 PetriNetUnfolderBase]: For 33211/33211 co-relation queries the response was YES. [2024-06-20 19:39:26,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 703 events. 388/703 cut-off events. For 33211/33211 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 3194 event pairs, 51 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 4411. Up to 556 conditions per place. [2024-06-20 19:39:26,449 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 107 selfloop transitions, 38 changer transitions 0/147 dead transitions. [2024-06-20 19:39:26,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 147 transitions, 1548 flow [2024-06-20 19:39:26,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 117 transitions. [2024-06-20 19:39:26,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-20 19:39:26,451 INFO L175 Difference]: Start difference. First operand has 141 places, 123 transitions, 1152 flow. Second operand 9 states and 117 transitions. [2024-06-20 19:39:26,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 147 transitions, 1548 flow [2024-06-20 19:39:26,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 147 transitions, 1453 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:26,508 INFO L231 Difference]: Finished difference. Result has 142 places, 125 transitions, 1182 flow [2024-06-20 19:39:26,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1182, PETRI_PLACES=142, PETRI_TRANSITIONS=125} [2024-06-20 19:39:26,509 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 113 predicate places. [2024-06-20 19:39:26,509 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 125 transitions, 1182 flow [2024-06-20 19:39:26,509 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-20 19:39:26,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:26,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:26,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:39:26,510 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:26,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:26,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1062500936, now seen corresponding path program 1 times [2024-06-20 19:39:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147034633] [2024-06-20 19:39:26,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:26,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:31,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:31,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147034633] [2024-06-20 19:39:31,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147034633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:31,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:31,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617343773] [2024-06-20 19:39:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:31,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:31,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:31,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 125 transitions, 1182 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:31,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:31,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:31,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:32,115 INFO L124 PetriNetUnfolderBase]: 396/719 cut-off events. [2024-06-20 19:39:32,115 INFO L125 PetriNetUnfolderBase]: For 36770/36770 co-relation queries the response was YES. [2024-06-20 19:39:32,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4561 conditions, 719 events. 396/719 cut-off events. For 36770/36770 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3298 event pairs, 59 based on Foata normal form. 4/722 useless extension candidates. Maximal degree in co-relation 4492. Up to 577 conditions per place. [2024-06-20 19:39:32,118 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 109 selfloop transitions, 33 changer transitions 0/144 dead transitions. [2024-06-20 19:39:32,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 1535 flow [2024-06-20 19:39:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2024-06-20 19:39:32,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40370370370370373 [2024-06-20 19:39:32,121 INFO L175 Difference]: Start difference. First operand has 142 places, 125 transitions, 1182 flow. Second operand 9 states and 109 transitions. [2024-06-20 19:39:32,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 1535 flow [2024-06-20 19:39:32,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 144 transitions, 1428 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:32,174 INFO L231 Difference]: Finished difference. Result has 145 places, 129 transitions, 1187 flow [2024-06-20 19:39:32,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1187, PETRI_PLACES=145, PETRI_TRANSITIONS=129} [2024-06-20 19:39:32,174 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 116 predicate places. [2024-06-20 19:39:32,174 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 129 transitions, 1187 flow [2024-06-20 19:39:32,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:32,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:32,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:32,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:39:32,175 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:32,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1062285455, now seen corresponding path program 9 times [2024-06-20 19:39:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:32,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737770305] [2024-06-20 19:39:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:32,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:38,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:38,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:38,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737770305] [2024-06-20 19:39:38,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737770305] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:38,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:38,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009824292] [2024-06-20 19:39:38,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:38,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:38,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:38,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:38,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:38,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 129 transitions, 1187 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:38,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:38,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:38,941 INFO L124 PetriNetUnfolderBase]: 416/763 cut-off events. [2024-06-20 19:39:38,941 INFO L125 PetriNetUnfolderBase]: For 46401/46401 co-relation queries the response was YES. [2024-06-20 19:39:38,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4720 conditions, 763 events. 416/763 cut-off events. For 46401/46401 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3577 event pairs, 63 based on Foata normal form. 12/774 useless extension candidates. Maximal degree in co-relation 4649. Up to 574 conditions per place. [2024-06-20 19:39:38,946 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 111 selfloop transitions, 32 changer transitions 8/153 dead transitions. [2024-06-20 19:39:38,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 153 transitions, 1585 flow [2024-06-20 19:39:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:38,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:39:38,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-20 19:39:38,947 INFO L175 Difference]: Start difference. First operand has 145 places, 129 transitions, 1187 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:39:38,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 153 transitions, 1585 flow [2024-06-20 19:39:39,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 153 transitions, 1510 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-20 19:39:39,017 INFO L231 Difference]: Finished difference. Result has 149 places, 127 transitions, 1162 flow [2024-06-20 19:39:39,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1162, PETRI_PLACES=149, PETRI_TRANSITIONS=127} [2024-06-20 19:39:39,018 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 120 predicate places. [2024-06-20 19:39:39,018 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 127 transitions, 1162 flow [2024-06-20 19:39:39,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:39,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:39,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:39,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:39:39,019 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:39,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:39,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1111388329, now seen corresponding path program 10 times [2024-06-20 19:39:39,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:39,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738481967] [2024-06-20 19:39:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:45,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:45,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738481967] [2024-06-20 19:39:45,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738481967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:45,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:45,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:39:45,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13795821] [2024-06-20 19:39:45,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:45,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:39:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:45,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:39:45,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:39:45,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:45,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 127 transitions, 1162 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-20 19:39:45,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:45,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:45,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:46,272 INFO L124 PetriNetUnfolderBase]: 410/757 cut-off events. [2024-06-20 19:39:46,272 INFO L125 PetriNetUnfolderBase]: For 48372/48372 co-relation queries the response was YES. [2024-06-20 19:39:46,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4690 conditions, 757 events. 410/757 cut-off events. For 48372/48372 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3566 event pairs, 55 based on Foata normal form. 12/768 useless extension candidates. Maximal degree in co-relation 4618. Up to 568 conditions per place. [2024-06-20 19:39:46,276 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 110 selfloop transitions, 34 changer transitions 8/154 dead transitions. [2024-06-20 19:39:46,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 154 transitions, 1577 flow [2024-06-20 19:39:46,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:39:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:39:46,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-06-20 19:39:46,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-20 19:39:46,278 INFO L175 Difference]: Start difference. First operand has 149 places, 127 transitions, 1162 flow. Second operand 9 states and 120 transitions. [2024-06-20 19:39:46,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 154 transitions, 1577 flow [2024-06-20 19:39:46,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 1507 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:46,348 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 1148 flow [2024-06-20 19:39:46,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1148, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2024-06-20 19:39:46,348 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 121 predicate places. [2024-06-20 19:39:46,349 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 1148 flow [2024-06-20 19:39:46,349 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-20 19:39:46,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:46,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:46,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:39:46,349 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:46,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 290192769, now seen corresponding path program 11 times [2024-06-20 19:39:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422892635] [2024-06-20 19:39:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422892635] [2024-06-20 19:39:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422892635] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:51,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051834509] [2024-06-20 19:39:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:51,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:51,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:51,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:51,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 1148 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:51,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:51,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:51,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:52,485 INFO L124 PetriNetUnfolderBase]: 404/751 cut-off events. [2024-06-20 19:39:52,485 INFO L125 PetriNetUnfolderBase]: For 50424/50424 co-relation queries the response was YES. [2024-06-20 19:39:52,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4689 conditions, 751 events. 404/751 cut-off events. For 50424/50424 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3573 event pairs, 59 based on Foata normal form. 12/762 useless extension candidates. Maximal degree in co-relation 4616. Up to 635 conditions per place. [2024-06-20 19:39:52,488 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 117 selfloop transitions, 21 changer transitions 8/148 dead transitions. [2024-06-20 19:39:52,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 148 transitions, 1546 flow [2024-06-20 19:39:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2024-06-20 19:39:52,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39666666666666667 [2024-06-20 19:39:52,490 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 1148 flow. Second operand 10 states and 119 transitions. [2024-06-20 19:39:52,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 148 transitions, 1546 flow [2024-06-20 19:39:52,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 148 transitions, 1470 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-06-20 19:39:52,563 INFO L231 Difference]: Finished difference. Result has 153 places, 123 transitions, 1104 flow [2024-06-20 19:39:52,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1104, PETRI_PLACES=153, PETRI_TRANSITIONS=123} [2024-06-20 19:39:52,563 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 124 predicate places. [2024-06-20 19:39:52,563 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 123 transitions, 1104 flow [2024-06-20 19:39:52,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:52,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:52,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:52,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:39:52,564 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:52,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:52,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1756864769, now seen corresponding path program 12 times [2024-06-20 19:39:52,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:52,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097853750] [2024-06-20 19:39:52,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:52,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:39:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:39:58,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:39:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097853750] [2024-06-20 19:39:58,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097853750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:39:58,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:39:58,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:39:58,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490131978] [2024-06-20 19:39:58,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:39:58,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:39:58,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:39:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:39:58,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:39:58,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:39:58,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 123 transitions, 1104 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:58,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:39:58,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:39:58,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:39:58,571 INFO L124 PetriNetUnfolderBase]: 362/673 cut-off events. [2024-06-20 19:39:58,572 INFO L125 PetriNetUnfolderBase]: For 38219/38219 co-relation queries the response was YES. [2024-06-20 19:39:58,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 673 events. 362/673 cut-off events. For 38219/38219 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3130 event pairs, 47 based on Foata normal form. 12/684 useless extension candidates. Maximal degree in co-relation 3723. Up to 578 conditions per place. [2024-06-20 19:39:58,576 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 116 selfloop transitions, 15 changer transitions 8/141 dead transitions. [2024-06-20 19:39:58,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 141 transitions, 1438 flow [2024-06-20 19:39:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:39:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:39:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:39:58,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-06-20 19:39:58,577 INFO L175 Difference]: Start difference. First operand has 153 places, 123 transitions, 1104 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:39:58,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 141 transitions, 1438 flow [2024-06-20 19:39:58,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 141 transitions, 1366 flow, removed 16 selfloop flow, removed 8 redundant places. [2024-06-20 19:39:58,634 INFO L231 Difference]: Finished difference. Result has 155 places, 118 transitions, 1025 flow [2024-06-20 19:39:58,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1025, PETRI_PLACES=155, PETRI_TRANSITIONS=118} [2024-06-20 19:39:58,635 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 126 predicate places. [2024-06-20 19:39:58,635 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 118 transitions, 1025 flow [2024-06-20 19:39:58,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:39:58,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:39:58,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:39:58,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-20 19:39:58,635 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:39:58,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:39:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1480976734, now seen corresponding path program 2 times [2024-06-20 19:39:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:39:58,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79434747] [2024-06-20 19:39:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:39:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:39:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:03,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:03,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79434747] [2024-06-20 19:40:03,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79434747] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:03,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:03,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:03,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332236939] [2024-06-20 19:40:03,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:03,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:03,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:03,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:03,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:03,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 118 transitions, 1025 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:03,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:03,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:03,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:04,204 INFO L124 PetriNetUnfolderBase]: 340/631 cut-off events. [2024-06-20 19:40:04,204 INFO L125 PetriNetUnfolderBase]: For 27207/27207 co-relation queries the response was YES. [2024-06-20 19:40:04,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3613 conditions, 631 events. 340/631 cut-off events. For 27207/27207 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 2904 event pairs, 43 based on Foata normal form. 2/632 useless extension candidates. Maximal degree in co-relation 3538. Up to 594 conditions per place. [2024-06-20 19:40:04,208 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 112 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2024-06-20 19:40:04,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 130 transitions, 1321 flow [2024-06-20 19:40:04,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:40:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:40:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2024-06-20 19:40:04,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3592592592592593 [2024-06-20 19:40:04,210 INFO L175 Difference]: Start difference. First operand has 155 places, 118 transitions, 1025 flow. Second operand 9 states and 97 transitions. [2024-06-20 19:40:04,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 130 transitions, 1321 flow [2024-06-20 19:40:04,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 130 transitions, 1213 flow, removed 4 selfloop flow, removed 12 redundant places. [2024-06-20 19:40:04,262 INFO L231 Difference]: Finished difference. Result has 152 places, 119 transitions, 970 flow [2024-06-20 19:40:04,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=970, PETRI_PLACES=152, PETRI_TRANSITIONS=119} [2024-06-20 19:40:04,262 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 123 predicate places. [2024-06-20 19:40:04,263 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 119 transitions, 970 flow [2024-06-20 19:40:04,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:04,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:04,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:04,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-20 19:40:04,263 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:04,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1013103430, now seen corresponding path program 7 times [2024-06-20 19:40:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205134521] [2024-06-20 19:40:04,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:09,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205134521] [2024-06-20 19:40:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205134521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708305511] [2024-06-20 19:40:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:09,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:09,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:09,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:09,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:09,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 119 transitions, 970 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:09,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:09,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:09,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:09,981 INFO L124 PetriNetUnfolderBase]: 346/641 cut-off events. [2024-06-20 19:40:09,981 INFO L125 PetriNetUnfolderBase]: For 28448/28448 co-relation queries the response was YES. [2024-06-20 19:40:09,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3612 conditions, 641 events. 346/641 cut-off events. For 28448/28448 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2973 event pairs, 39 based on Foata normal form. 2/642 useless extension candidates. Maximal degree in co-relation 3537. Up to 584 conditions per place. [2024-06-20 19:40:09,984 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 117 selfloop transitions, 19 changer transitions 0/138 dead transitions. [2024-06-20 19:40:09,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 138 transitions, 1342 flow [2024-06-20 19:40:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2024-06-20 19:40:09,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37666666666666665 [2024-06-20 19:40:09,985 INFO L175 Difference]: Start difference. First operand has 152 places, 119 transitions, 970 flow. Second operand 10 states and 113 transitions. [2024-06-20 19:40:09,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 138 transitions, 1342 flow [2024-06-20 19:40:10,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 138 transitions, 1301 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:40:10,041 INFO L231 Difference]: Finished difference. Result has 155 places, 121 transitions, 1020 flow [2024-06-20 19:40:10,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1020, PETRI_PLACES=155, PETRI_TRANSITIONS=121} [2024-06-20 19:40:10,041 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 126 predicate places. [2024-06-20 19:40:10,041 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 121 transitions, 1020 flow [2024-06-20 19:40:10,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:10,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:10,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:10,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-20 19:40:10,042 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:10,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1012888104, now seen corresponding path program 3 times [2024-06-20 19:40:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:10,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185826594] [2024-06-20 19:40:10,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:15,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:15,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185826594] [2024-06-20 19:40:15,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185826594] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:15,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:15,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:40:15,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162012629] [2024-06-20 19:40:15,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:15,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:40:15,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:15,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:40:15,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:40:15,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:15,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 121 transitions, 1020 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-20 19:40:15,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:15,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:15,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:15,966 INFO L124 PetriNetUnfolderBase]: 350/649 cut-off events. [2024-06-20 19:40:15,967 INFO L125 PetriNetUnfolderBase]: For 29587/29587 co-relation queries the response was YES. [2024-06-20 19:40:15,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3683 conditions, 649 events. 350/649 cut-off events. For 29587/29587 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3022 event pairs, 37 based on Foata normal form. 2/650 useless extension candidates. Maximal degree in co-relation 3607. Up to 608 conditions per place. [2024-06-20 19:40:15,971 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 119 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-20 19:40:15,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 137 transitions, 1357 flow [2024-06-20 19:40:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:40:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:40:15,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 100 transitions. [2024-06-20 19:40:15,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2024-06-20 19:40:15,972 INFO L175 Difference]: Start difference. First operand has 155 places, 121 transitions, 1020 flow. Second operand 9 states and 100 transitions. [2024-06-20 19:40:15,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 137 transitions, 1357 flow [2024-06-20 19:40:16,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 137 transitions, 1284 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:16,029 INFO L231 Difference]: Finished difference. Result has 157 places, 124 transitions, 1021 flow [2024-06-20 19:40:16,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1021, PETRI_PLACES=157, PETRI_TRANSITIONS=124} [2024-06-20 19:40:16,030 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 128 predicate places. [2024-06-20 19:40:16,030 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 124 transitions, 1021 flow [2024-06-20 19:40:16,030 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-20 19:40:16,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:16,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:16,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-20 19:40:16,031 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:16,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1756864924, now seen corresponding path program 8 times [2024-06-20 19:40:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013915575] [2024-06-20 19:40:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:20,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:20,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013915575] [2024-06-20 19:40:20,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013915575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:20,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:20,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:20,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981572002] [2024-06-20 19:40:20,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:20,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:20,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:20,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:21,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:21,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 124 transitions, 1021 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:21,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:21,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:21,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:21,470 INFO L124 PetriNetUnfolderBase]: 346/643 cut-off events. [2024-06-20 19:40:21,470 INFO L125 PetriNetUnfolderBase]: For 27549/27549 co-relation queries the response was YES. [2024-06-20 19:40:21,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 643 events. 346/643 cut-off events. For 27549/27549 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2993 event pairs, 40 based on Foata normal form. 2/644 useless extension candidates. Maximal degree in co-relation 3438. Up to 598 conditions per place. [2024-06-20 19:40:21,473 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 121 selfloop transitions, 16 changer transitions 0/139 dead transitions. [2024-06-20 19:40:21,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 139 transitions, 1345 flow [2024-06-20 19:40:21,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:21,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:21,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:40:21,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-06-20 19:40:21,474 INFO L175 Difference]: Start difference. First operand has 157 places, 124 transitions, 1021 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:40:21,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 139 transitions, 1345 flow [2024-06-20 19:40:21,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 139 transitions, 1281 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-20 19:40:21,533 INFO L231 Difference]: Finished difference. Result has 161 places, 124 transitions, 994 flow [2024-06-20 19:40:21,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=994, PETRI_PLACES=161, PETRI_TRANSITIONS=124} [2024-06-20 19:40:21,533 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 132 predicate places. [2024-06-20 19:40:21,533 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 124 transitions, 994 flow [2024-06-20 19:40:21,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:21,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:21,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:21,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-20 19:40:21,534 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:21,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:21,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1764489281, now seen corresponding path program 1 times [2024-06-20 19:40:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769664154] [2024-06-20 19:40:21,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:21,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:26,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-20 19:40:26,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:26,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769664154] [2024-06-20 19:40:26,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769664154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:26,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:26,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608222610] [2024-06-20 19:40:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:26,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:26,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:26,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:27,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:27,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 124 transitions, 994 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:27,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:27,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:27,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:27,514 INFO L124 PetriNetUnfolderBase]: 344/640 cut-off events. [2024-06-20 19:40:27,514 INFO L125 PetriNetUnfolderBase]: For 25303/25303 co-relation queries the response was YES. [2024-06-20 19:40:27,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 640 events. 344/640 cut-off events. For 25303/25303 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2965 event pairs, 41 based on Foata normal form. 1/640 useless extension candidates. Maximal degree in co-relation 3335. Up to 600 conditions per place. [2024-06-20 19:40:27,518 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 116 selfloop transitions, 19 changer transitions 0/137 dead transitions. [2024-06-20 19:40:27,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 137 transitions, 1316 flow [2024-06-20 19:40:27,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:40:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:40:27,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2024-06-20 19:40:27,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.362962962962963 [2024-06-20 19:40:27,520 INFO L175 Difference]: Start difference. First operand has 161 places, 124 transitions, 994 flow. Second operand 9 states and 98 transitions. [2024-06-20 19:40:27,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 137 transitions, 1316 flow [2024-06-20 19:40:27,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 137 transitions, 1207 flow, removed 10 selfloop flow, removed 11 redundant places. [2024-06-20 19:40:27,572 INFO L231 Difference]: Finished difference. Result has 159 places, 126 transitions, 959 flow [2024-06-20 19:40:27,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=159, PETRI_TRANSITIONS=126} [2024-06-20 19:40:27,572 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 130 predicate places. [2024-06-20 19:40:27,573 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 126 transitions, 959 flow [2024-06-20 19:40:27,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:27,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:27,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:27,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-20 19:40:27,573 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:27,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:27,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1764498860, now seen corresponding path program 4 times [2024-06-20 19:40:27,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:27,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514552805] [2024-06-20 19:40:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:27,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:32,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:32,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:32,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514552805] [2024-06-20 19:40:32,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514552805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:32,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:32,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:32,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518074824] [2024-06-20 19:40:32,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:32,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:32,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:32,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:32,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:32,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 126 transitions, 959 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:32,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:32,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:32,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:32,882 INFO L124 PetriNetUnfolderBase]: 348/648 cut-off events. [2024-06-20 19:40:32,882 INFO L125 PetriNetUnfolderBase]: For 27557/27557 co-relation queries the response was YES. [2024-06-20 19:40:32,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3373 conditions, 648 events. 348/648 cut-off events. For 27557/27557 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3035 event pairs, 41 based on Foata normal form. 2/649 useless extension candidates. Maximal degree in co-relation 3295. Up to 614 conditions per place. [2024-06-20 19:40:32,886 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 123 selfloop transitions, 13 changer transitions 0/138 dead transitions. [2024-06-20 19:40:32,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 138 transitions, 1273 flow [2024-06-20 19:40:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:40:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:40:32,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2024-06-20 19:40:32,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35185185185185186 [2024-06-20 19:40:32,887 INFO L175 Difference]: Start difference. First operand has 159 places, 126 transitions, 959 flow. Second operand 9 states and 95 transitions. [2024-06-20 19:40:32,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 138 transitions, 1273 flow [2024-06-20 19:40:32,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 138 transitions, 1219 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-20 19:40:32,936 INFO L231 Difference]: Finished difference. Result has 161 places, 127 transitions, 955 flow [2024-06-20 19:40:32,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=955, PETRI_PLACES=161, PETRI_TRANSITIONS=127} [2024-06-20 19:40:32,936 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 132 predicate places. [2024-06-20 19:40:32,936 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 127 transitions, 955 flow [2024-06-20 19:40:32,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:32,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:32,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:32,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-20 19:40:32,937 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:32,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1757080250, now seen corresponding path program 5 times [2024-06-20 19:40:32,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127725346] [2024-06-20 19:40:32,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:38,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127725346] [2024-06-20 19:40:38,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127725346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:38,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:38,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652747578] [2024-06-20 19:40:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:38,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:38,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:38,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:38,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:38,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:38,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 127 transitions, 955 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:38,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:38,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:38,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:38,548 INFO L124 PetriNetUnfolderBase]: 345/643 cut-off events. [2024-06-20 19:40:38,549 INFO L125 PetriNetUnfolderBase]: For 24798/24798 co-relation queries the response was YES. [2024-06-20 19:40:38,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 643 events. 345/643 cut-off events. For 24798/24798 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3009 event pairs, 41 based on Foata normal form. 2/644 useless extension candidates. Maximal degree in co-relation 3130. Up to 614 conditions per place. [2024-06-20 19:40:38,552 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 125 selfloop transitions, 13 changer transitions 0/140 dead transitions. [2024-06-20 19:40:38,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 140 transitions, 1272 flow [2024-06-20 19:40:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:40:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:40:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-06-20 19:40:38,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-20 19:40:38,554 INFO L175 Difference]: Start difference. First operand has 161 places, 127 transitions, 955 flow. Second operand 9 states and 96 transitions. [2024-06-20 19:40:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 140 transitions, 1272 flow [2024-06-20 19:40:38,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 140 transitions, 1232 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:40:38,604 INFO L231 Difference]: Finished difference. Result has 164 places, 129 transitions, 965 flow [2024-06-20 19:40:38,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=965, PETRI_PLACES=164, PETRI_TRANSITIONS=129} [2024-06-20 19:40:38,605 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 135 predicate places. [2024-06-20 19:40:38,605 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 129 transitions, 965 flow [2024-06-20 19:40:38,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:38,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:38,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:38,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-20 19:40:38,605 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:38,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1764222154, now seen corresponding path program 9 times [2024-06-20 19:40:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:38,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640273011] [2024-06-20 19:40:38,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:43,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640273011] [2024-06-20 19:40:43,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640273011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:43,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891040777] [2024-06-20 19:40:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:43,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:43,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:43,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:43,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:43,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:43,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 129 transitions, 965 flow. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:43,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:43,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:43,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:43,813 INFO L124 PetriNetUnfolderBase]: 341/637 cut-off events. [2024-06-20 19:40:43,813 INFO L125 PetriNetUnfolderBase]: For 22458/22458 co-relation queries the response was YES. [2024-06-20 19:40:43,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3071 conditions, 637 events. 341/637 cut-off events. For 22458/22458 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2990 event pairs, 38 based on Foata normal form. 2/638 useless extension candidates. Maximal degree in co-relation 2990. Up to 587 conditions per place. [2024-06-20 19:40:43,817 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 121 selfloop transitions, 21 changer transitions 0/144 dead transitions. [2024-06-20 19:40:43,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 144 transitions, 1311 flow [2024-06-20 19:40:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:40:43,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-20 19:40:43,818 INFO L175 Difference]: Start difference. First operand has 164 places, 129 transitions, 965 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:40:43,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 144 transitions, 1311 flow [2024-06-20 19:40:43,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 144 transitions, 1248 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:43,860 INFO L231 Difference]: Finished difference. Result has 166 places, 131 transitions, 982 flow [2024-06-20 19:40:43,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=982, PETRI_PLACES=166, PETRI_TRANSITIONS=131} [2024-06-20 19:40:43,860 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2024-06-20 19:40:43,860 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 131 transitions, 982 flow [2024-06-20 19:40:43,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:40:43,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:43,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:43,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-20 19:40:43,861 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:43,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash 824058064, now seen corresponding path program 1 times [2024-06-20 19:40:43,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:43,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568044897] [2024-06-20 19:40:43,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:43,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:48,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568044897] [2024-06-20 19:40:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568044897] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376066260] [2024-06-20 19:40:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:48,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:49,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:49,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 131 transitions, 982 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-20 19:40:49,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:49,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:49,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:49,612 INFO L124 PetriNetUnfolderBase]: 378/716 cut-off events. [2024-06-20 19:40:49,613 INFO L125 PetriNetUnfolderBase]: For 45205/45205 co-relation queries the response was YES. [2024-06-20 19:40:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3806 conditions, 716 events. 378/716 cut-off events. For 45205/45205 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3418 event pairs, 53 based on Foata normal form. 8/723 useless extension candidates. Maximal degree in co-relation 3726. Up to 265 conditions per place. [2024-06-20 19:40:49,617 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 92 selfloop transitions, 53 changer transitions 15/162 dead transitions. [2024-06-20 19:40:49,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 162 transitions, 1564 flow [2024-06-20 19:40:49,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2024-06-20 19:40:49,618 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42333333333333334 [2024-06-20 19:40:49,618 INFO L175 Difference]: Start difference. First operand has 166 places, 131 transitions, 982 flow. Second operand 10 states and 127 transitions. [2024-06-20 19:40:49,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 162 transitions, 1564 flow [2024-06-20 19:40:49,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 162 transitions, 1476 flow, removed 24 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:49,681 INFO L231 Difference]: Finished difference. Result has 169 places, 130 transitions, 1060 flow [2024-06-20 19:40:49,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1060, PETRI_PLACES=169, PETRI_TRANSITIONS=130} [2024-06-20 19:40:49,682 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 140 predicate places. [2024-06-20 19:40:49,682 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 130 transitions, 1060 flow [2024-06-20 19:40:49,682 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-20 19:40:49,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:49,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:49,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-20 19:40:49,683 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:49,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:49,683 INFO L85 PathProgramCache]: Analyzing trace with hash 882150514, now seen corresponding path program 2 times [2024-06-20 19:40:49,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:49,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064390855] [2024-06-20 19:40:49,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:49,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:40:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:40:54,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:40:54,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064390855] [2024-06-20 19:40:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064390855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:40:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:40:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:40:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379843842] [2024-06-20 19:40:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:40:54,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:40:54,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:40:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:40:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:40:55,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:40:55,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 130 transitions, 1060 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-20 19:40:55,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:40:55,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:40:55,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:40:55,480 INFO L124 PetriNetUnfolderBase]: 395/755 cut-off events. [2024-06-20 19:40:55,480 INFO L125 PetriNetUnfolderBase]: For 63612/63612 co-relation queries the response was YES. [2024-06-20 19:40:55,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4671 conditions, 755 events. 395/755 cut-off events. For 63612/63612 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3694 event pairs, 70 based on Foata normal form. 8/762 useless extension candidates. Maximal degree in co-relation 4589. Up to 389 conditions per place. [2024-06-20 19:40:55,485 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 92 selfloop transitions, 53 changer transitions 13/160 dead transitions. [2024-06-20 19:40:55,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 160 transitions, 1612 flow [2024-06-20 19:40:55,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:40:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:40:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 132 transitions. [2024-06-20 19:40:55,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-06-20 19:40:55,486 INFO L175 Difference]: Start difference. First operand has 169 places, 130 transitions, 1060 flow. Second operand 10 states and 132 transitions. [2024-06-20 19:40:55,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 160 transitions, 1612 flow [2024-06-20 19:40:55,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 160 transitions, 1528 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:40:55,555 INFO L231 Difference]: Finished difference. Result has 166 places, 127 transitions, 1076 flow [2024-06-20 19:40:55,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1076, PETRI_PLACES=166, PETRI_TRANSITIONS=127} [2024-06-20 19:40:55,555 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 137 predicate places. [2024-06-20 19:40:55,556 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 127 transitions, 1076 flow [2024-06-20 19:40:55,556 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-20 19:40:55,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:40:55,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:40:55,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-20 19:40:55,556 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:40:55,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:40:55,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1289364134, now seen corresponding path program 3 times [2024-06-20 19:40:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:40:55,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466486657] [2024-06-20 19:40:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:40:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:40:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466486657] [2024-06-20 19:41:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466486657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:01,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:01,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631552390] [2024-06-20 19:41:01,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:01,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:01,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:01,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:01,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:01,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 127 transitions, 1076 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-20 19:41:01,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:01,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:01,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:02,134 INFO L124 PetriNetUnfolderBase]: 385/737 cut-off events. [2024-06-20 19:41:02,134 INFO L125 PetriNetUnfolderBase]: For 59221/59221 co-relation queries the response was YES. [2024-06-20 19:41:02,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4570 conditions, 737 events. 385/737 cut-off events. For 59221/59221 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3581 event pairs, 65 based on Foata normal form. 8/744 useless extension candidates. Maximal degree in co-relation 4491. Up to 414 conditions per place. [2024-06-20 19:41:02,139 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 97 selfloop transitions, 47 changer transitions 10/156 dead transitions. [2024-06-20 19:41:02,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 156 transitions, 1608 flow [2024-06-20 19:41:02,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:02,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:41:02,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-06-20 19:41:02,140 INFO L175 Difference]: Start difference. First operand has 166 places, 127 transitions, 1076 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:41:02,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 156 transitions, 1608 flow [2024-06-20 19:41:02,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 156 transitions, 1491 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:02,226 INFO L231 Difference]: Finished difference. Result has 163 places, 125 transitions, 1047 flow [2024-06-20 19:41:02,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1047, PETRI_PLACES=163, PETRI_TRANSITIONS=125} [2024-06-20 19:41:02,226 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 134 predicate places. [2024-06-20 19:41:02,227 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 125 transitions, 1047 flow [2024-06-20 19:41:02,227 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-20 19:41:02,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:02,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:02,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-20 19:41:02,227 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:02,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash 882270484, now seen corresponding path program 4 times [2024-06-20 19:41:02,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:02,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105933327] [2024-06-20 19:41:02,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:02,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105933327] [2024-06-20 19:41:07,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105933327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:07,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:07,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:07,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407782626] [2024-06-20 19:41:07,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:07,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:07,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:07,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:07,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:07,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:07,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 125 transitions, 1047 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-20 19:41:07,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:07,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:07,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:07,952 INFO L124 PetriNetUnfolderBase]: 354/676 cut-off events. [2024-06-20 19:41:07,952 INFO L125 PetriNetUnfolderBase]: For 43693/43693 co-relation queries the response was YES. [2024-06-20 19:41:07,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3764 conditions, 676 events. 354/676 cut-off events. For 43693/43693 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3199 event pairs, 56 based on Foata normal form. 10/685 useless extension candidates. Maximal degree in co-relation 3687. Up to 414 conditions per place. [2024-06-20 19:41:07,956 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 83 selfloop transitions, 43 changer transitions 21/149 dead transitions. [2024-06-20 19:41:07,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 149 transitions, 1427 flow [2024-06-20 19:41:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:07,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2024-06-20 19:41:07,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4066666666666667 [2024-06-20 19:41:07,959 INFO L175 Difference]: Start difference. First operand has 163 places, 125 transitions, 1047 flow. Second operand 10 states and 122 transitions. [2024-06-20 19:41:07,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 149 transitions, 1427 flow [2024-06-20 19:41:08,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 149 transitions, 1331 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:08,030 INFO L231 Difference]: Finished difference. Result has 162 places, 120 transitions, 1002 flow [2024-06-20 19:41:08,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1002, PETRI_PLACES=162, PETRI_TRANSITIONS=120} [2024-06-20 19:41:08,031 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 133 predicate places. [2024-06-20 19:41:08,031 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 120 transitions, 1002 flow [2024-06-20 19:41:08,031 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-20 19:41:08,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:08,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:08,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-20 19:41:08,032 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:08,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:08,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1402550626, now seen corresponding path program 5 times [2024-06-20 19:41:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:08,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851082819] [2024-06-20 19:41:08,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:08,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:14,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-20 19:41:14,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:14,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851082819] [2024-06-20 19:41:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851082819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832058201] [2024-06-20 19:41:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:14,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:14,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:14,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:14,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:14,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 120 transitions, 1002 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-20 19:41:14,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:14,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:14,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:15,121 INFO L124 PetriNetUnfolderBase]: 384/742 cut-off events. [2024-06-20 19:41:15,121 INFO L125 PetriNetUnfolderBase]: For 61049/61049 co-relation queries the response was YES. [2024-06-20 19:41:15,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4757 conditions, 742 events. 384/742 cut-off events. For 61049/61049 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3649 event pairs, 78 based on Foata normal form. 8/749 useless extension candidates. Maximal degree in co-relation 4681. Up to 451 conditions per place. [2024-06-20 19:41:15,126 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 105 selfloop transitions, 29 changer transitions 10/146 dead transitions. [2024-06-20 19:41:15,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 146 transitions, 1500 flow [2024-06-20 19:41:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2024-06-20 19:41:15,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-06-20 19:41:15,128 INFO L175 Difference]: Start difference. First operand has 162 places, 120 transitions, 1002 flow. Second operand 10 states and 128 transitions. [2024-06-20 19:41:15,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 146 transitions, 1500 flow [2024-06-20 19:41:15,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 146 transitions, 1402 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-20 19:41:15,220 INFO L231 Difference]: Finished difference. Result has 155 places, 118 transitions, 956 flow [2024-06-20 19:41:15,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=956, PETRI_PLACES=155, PETRI_TRANSITIONS=118} [2024-06-20 19:41:15,221 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 126 predicate places. [2024-06-20 19:41:15,221 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 118 transitions, 956 flow [2024-06-20 19:41:15,221 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-20 19:41:15,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:15,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:15,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-20 19:41:15,221 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:15,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1402555276, now seen corresponding path program 6 times [2024-06-20 19:41:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:15,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547092945] [2024-06-20 19:41:15,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:15,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:22,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:22,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:22,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547092945] [2024-06-20 19:41:22,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547092945] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:22,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:22,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:22,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892206000] [2024-06-20 19:41:22,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:22,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:22,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:22,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:22,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:22,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:22,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 118 transitions, 956 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-20 19:41:22,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:22,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:22,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:23,257 INFO L124 PetriNetUnfolderBase]: 353/681 cut-off events. [2024-06-20 19:41:23,257 INFO L125 PetriNetUnfolderBase]: For 46394/46394 co-relation queries the response was YES. [2024-06-20 19:41:23,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3940 conditions, 681 events. 353/681 cut-off events. For 46394/46394 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3258 event pairs, 67 based on Foata normal form. 10/690 useless extension candidates. Maximal degree in co-relation 3866. Up to 488 conditions per place. [2024-06-20 19:41:23,262 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 96 selfloop transitions, 28 changer transitions 14/140 dead transitions. [2024-06-20 19:41:23,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 140 transitions, 1312 flow [2024-06-20 19:41:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:41:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:41:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 130 transitions. [2024-06-20 19:41:23,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2024-06-20 19:41:23,263 INFO L175 Difference]: Start difference. First operand has 155 places, 118 transitions, 956 flow. Second operand 11 states and 130 transitions. [2024-06-20 19:41:23,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 140 transitions, 1312 flow [2024-06-20 19:41:23,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 140 transitions, 1250 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:41:23,317 INFO L231 Difference]: Finished difference. Result has 154 places, 114 transitions, 922 flow [2024-06-20 19:41:23,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=922, PETRI_PLACES=154, PETRI_TRANSITIONS=114} [2024-06-20 19:41:23,317 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 125 predicate places. [2024-06-20 19:41:23,318 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 114 transitions, 922 flow [2024-06-20 19:41:23,318 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-20 19:41:23,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:23,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:23,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-20 19:41:23,318 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:23,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:23,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1398086626, now seen corresponding path program 7 times [2024-06-20 19:41:23,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:23,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147208951] [2024-06-20 19:41:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:28,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147208951] [2024-06-20 19:41:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147208951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:28,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:28,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65753966] [2024-06-20 19:41:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:28,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:28,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:28,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:28,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:28,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:28,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 114 transitions, 922 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-20 19:41:28,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:28,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:28,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:29,261 INFO L124 PetriNetUnfolderBase]: 329/633 cut-off events. [2024-06-20 19:41:29,261 INFO L125 PetriNetUnfolderBase]: For 37299/37299 co-relation queries the response was YES. [2024-06-20 19:41:29,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 633 events. 329/633 cut-off events. For 37299/37299 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2948 event pairs, 54 based on Foata normal form. 10/642 useless extension candidates. Maximal degree in co-relation 3382. Up to 449 conditions per place. [2024-06-20 19:41:29,265 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 92 selfloop transitions, 27 changer transitions 14/135 dead transitions. [2024-06-20 19:41:29,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 135 transitions, 1266 flow [2024-06-20 19:41:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 121 transitions. [2024-06-20 19:41:29,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4033333333333333 [2024-06-20 19:41:29,266 INFO L175 Difference]: Start difference. First operand has 154 places, 114 transitions, 922 flow. Second operand 10 states and 121 transitions. [2024-06-20 19:41:29,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 135 transitions, 1266 flow [2024-06-20 19:41:29,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 135 transitions, 1193 flow, removed 7 selfloop flow, removed 11 redundant places. [2024-06-20 19:41:29,317 INFO L231 Difference]: Finished difference. Result has 149 places, 111 transitions, 887 flow [2024-06-20 19:41:29,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=887, PETRI_PLACES=149, PETRI_TRANSITIONS=111} [2024-06-20 19:41:29,318 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 120 predicate places. [2024-06-20 19:41:29,318 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 111 transitions, 887 flow [2024-06-20 19:41:29,318 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-20 19:41:29,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:29,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:29,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-20 19:41:29,319 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:29,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:29,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1398081976, now seen corresponding path program 8 times [2024-06-20 19:41:29,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:29,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48208677] [2024-06-20 19:41:29,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:29,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:34,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:34,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48208677] [2024-06-20 19:41:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48208677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:34,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408015262] [2024-06-20 19:41:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:34,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:34,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:34,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:34,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:34,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 111 transitions, 887 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-20 19:41:34,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:34,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:34,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:35,296 INFO L124 PetriNetUnfolderBase]: 317/613 cut-off events. [2024-06-20 19:41:35,296 INFO L125 PetriNetUnfolderBase]: For 32267/32267 co-relation queries the response was YES. [2024-06-20 19:41:35,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3277 conditions, 613 events. 317/613 cut-off events. For 32267/32267 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2839 event pairs, 50 based on Foata normal form. 8/620 useless extension candidates. Maximal degree in co-relation 3206. Up to 439 conditions per place. [2024-06-20 19:41:35,299 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 90 selfloop transitions, 25 changer transitions 14/131 dead transitions. [2024-06-20 19:41:35,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 131 transitions, 1207 flow [2024-06-20 19:41:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:35,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:41:35,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2024-06-20 19:41:35,301 INFO L175 Difference]: Start difference. First operand has 149 places, 111 transitions, 887 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:41:35,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 131 transitions, 1207 flow [2024-06-20 19:41:35,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 131 transitions, 1149 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:35,342 INFO L231 Difference]: Finished difference. Result has 147 places, 108 transitions, 861 flow [2024-06-20 19:41:35,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=861, PETRI_PLACES=147, PETRI_TRANSITIONS=108} [2024-06-20 19:41:35,342 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 118 predicate places. [2024-06-20 19:41:35,342 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 108 transitions, 861 flow [2024-06-20 19:41:35,342 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-20 19:41:35,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:35,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:35,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-20 19:41:35,343 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:35,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1397966656, now seen corresponding path program 9 times [2024-06-20 19:41:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802571080] [2024-06-20 19:41:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:40,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802571080] [2024-06-20 19:41:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802571080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249713702] [2024-06-20 19:41:40,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:40,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:40,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:40,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:40,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:41,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:41,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 108 transitions, 861 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-20 19:41:41,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:41,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:41,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:41,408 INFO L124 PetriNetUnfolderBase]: 310/600 cut-off events. [2024-06-20 19:41:41,408 INFO L125 PetriNetUnfolderBase]: For 30944/30944 co-relation queries the response was YES. [2024-06-20 19:41:41,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 600 events. 310/600 cut-off events. For 30944/30944 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2745 event pairs, 48 based on Foata normal form. 8/607 useless extension candidates. Maximal degree in co-relation 3138. Up to 421 conditions per place. [2024-06-20 19:41:41,411 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 87 selfloop transitions, 23 changer transitions 17/129 dead transitions. [2024-06-20 19:41:41,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 129 transitions, 1179 flow [2024-06-20 19:41:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:41,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:41,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2024-06-20 19:41:41,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3933333333333333 [2024-06-20 19:41:41,413 INFO L175 Difference]: Start difference. First operand has 147 places, 108 transitions, 861 flow. Second operand 10 states and 118 transitions. [2024-06-20 19:41:41,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 129 transitions, 1179 flow [2024-06-20 19:41:41,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 129 transitions, 1123 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:41,455 INFO L231 Difference]: Finished difference. Result has 143 places, 104 transitions, 823 flow [2024-06-20 19:41:41,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=823, PETRI_PLACES=143, PETRI_TRANSITIONS=104} [2024-06-20 19:41:41,455 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 114 predicate places. [2024-06-20 19:41:41,455 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 104 transitions, 823 flow [2024-06-20 19:41:41,455 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-20 19:41:41,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:41,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:41,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-20 19:41:41,456 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:41,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:41,456 INFO L85 PathProgramCache]: Analyzing trace with hash 523631330, now seen corresponding path program 10 times [2024-06-20 19:41:41,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:41,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805441226] [2024-06-20 19:41:41,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:41,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:47,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:47,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805441226] [2024-06-20 19:41:47,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805441226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:47,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:47,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:47,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737738942] [2024-06-20 19:41:47,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:47,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:47,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:47,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:47,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:47,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 104 transitions, 823 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-20 19:41:47,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:47,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:47,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:47,902 INFO L124 PetriNetUnfolderBase]: 299/579 cut-off events. [2024-06-20 19:41:47,902 INFO L125 PetriNetUnfolderBase]: For 28409/28409 co-relation queries the response was YES. [2024-06-20 19:41:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 579 events. 299/579 cut-off events. For 28409/28409 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2585 event pairs, 39 based on Foata normal form. 8/586 useless extension candidates. Maximal degree in co-relation 3022. Up to 169 conditions per place. [2024-06-20 19:41:47,905 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 68 selfloop transitions, 50 changer transitions 16/136 dead transitions. [2024-06-20 19:41:47,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 136 transitions, 1293 flow [2024-06-20 19:41:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 131 transitions. [2024-06-20 19:41:47,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43666666666666665 [2024-06-20 19:41:47,906 INFO L175 Difference]: Start difference. First operand has 143 places, 104 transitions, 823 flow. Second operand 10 states and 131 transitions. [2024-06-20 19:41:47,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 136 transitions, 1293 flow [2024-06-20 19:41:47,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 1227 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:47,941 INFO L231 Difference]: Finished difference. Result has 137 places, 101 transitions, 849 flow [2024-06-20 19:41:47,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=849, PETRI_PLACES=137, PETRI_TRANSITIONS=101} [2024-06-20 19:41:47,941 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 108 predicate places. [2024-06-20 19:41:47,941 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 101 transitions, 849 flow [2024-06-20 19:41:47,941 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-20 19:41:47,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:47,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:47,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-20 19:41:47,942 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:47,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:47,942 INFO L85 PathProgramCache]: Analyzing trace with hash 523746650, now seen corresponding path program 11 times [2024-06-20 19:41:47,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:47,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893032565] [2024-06-20 19:41:47,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:47,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:53,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:53,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893032565] [2024-06-20 19:41:53,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893032565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:53,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:53,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:53,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992423024] [2024-06-20 19:41:53,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:53,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:53,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:53,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:53,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 101 transitions, 849 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-20 19:41:53,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:53,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:53,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:41:53,898 INFO L124 PetriNetUnfolderBase]: 310/602 cut-off events. [2024-06-20 19:41:53,898 INFO L125 PetriNetUnfolderBase]: For 33605/33605 co-relation queries the response was YES. [2024-06-20 19:41:53,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3567 conditions, 602 events. 310/602 cut-off events. For 33605/33605 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2769 event pairs, 55 based on Foata normal form. 8/609 useless extension candidates. Maximal degree in co-relation 3502. Up to 312 conditions per place. [2024-06-20 19:41:53,902 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 76 selfloop transitions, 43 changer transitions 10/131 dead transitions. [2024-06-20 19:41:53,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 131 transitions, 1299 flow [2024-06-20 19:41:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:41:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:41:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 130 transitions. [2024-06-20 19:41:53,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-20 19:41:53,904 INFO L175 Difference]: Start difference. First operand has 137 places, 101 transitions, 849 flow. Second operand 10 states and 130 transitions. [2024-06-20 19:41:53,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 131 transitions, 1299 flow [2024-06-20 19:41:53,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 131 transitions, 1204 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-20 19:41:53,942 INFO L231 Difference]: Finished difference. Result has 134 places, 99 transitions, 833 flow [2024-06-20 19:41:53,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=760, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=833, PETRI_PLACES=134, PETRI_TRANSITIONS=99} [2024-06-20 19:41:53,943 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2024-06-20 19:41:53,943 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 99 transitions, 833 flow [2024-06-20 19:41:53,943 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-20 19:41:53,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:41:53,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:41:53,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-20 19:41:53,943 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:41:53,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:41:53,943 INFO L85 PathProgramCache]: Analyzing trace with hash 523751300, now seen corresponding path program 12 times [2024-06-20 19:41:53,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:41:53,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706048836] [2024-06-20 19:41:53,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:41:53,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:41:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:41:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:41:59,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:41:59,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706048836] [2024-06-20 19:41:59,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706048836] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:41:59,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:41:59,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:41:59,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12559634] [2024-06-20 19:41:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:41:59,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:41:59,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:41:59,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:41:59,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:41:59,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:41:59,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 99 transitions, 833 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-20 19:41:59,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:41:59,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:41:59,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:00,373 INFO L124 PetriNetUnfolderBase]: 279/541 cut-off events. [2024-06-20 19:42:00,373 INFO L125 PetriNetUnfolderBase]: For 24302/24302 co-relation queries the response was YES. [2024-06-20 19:42:00,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2945 conditions, 541 events. 279/541 cut-off events. For 24302/24302 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2410 event pairs, 46 based on Foata normal form. 10/550 useless extension candidates. Maximal degree in co-relation 2882. Up to 312 conditions per place. [2024-06-20 19:42:00,376 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 66 selfloop transitions, 39 changer transitions 17/124 dead transitions. [2024-06-20 19:42:00,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 124 transitions, 1161 flow [2024-06-20 19:42:00,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:00,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 124 transitions. [2024-06-20 19:42:00,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41333333333333333 [2024-06-20 19:42:00,377 INFO L175 Difference]: Start difference. First operand has 134 places, 99 transitions, 833 flow. Second operand 10 states and 124 transitions. [2024-06-20 19:42:00,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 124 transitions, 1161 flow [2024-06-20 19:42:00,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 124 transitions, 1073 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:00,403 INFO L231 Difference]: Finished difference. Result has 133 places, 94 transitions, 783 flow [2024-06-20 19:42:00,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=783, PETRI_PLACES=133, PETRI_TRANSITIONS=94} [2024-06-20 19:42:00,404 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 104 predicate places. [2024-06-20 19:42:00,404 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 94 transitions, 783 flow [2024-06-20 19:42:00,404 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-20 19:42:00,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:00,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:00,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-20 19:42:00,405 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:00,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash 528215300, now seen corresponding path program 13 times [2024-06-20 19:42:00,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:00,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920167395] [2024-06-20 19:42:00,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:00,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:05,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920167395] [2024-06-20 19:42:05,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920167395] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:05,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:05,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:42:05,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923199098] [2024-06-20 19:42:05,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:42:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:05,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:42:05,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:42:05,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:05,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 94 transitions, 783 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-20 19:42:05,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:05,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:05,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:06,243 INFO L124 PetriNetUnfolderBase]: 290/565 cut-off events. [2024-06-20 19:42:06,243 INFO L125 PetriNetUnfolderBase]: For 28968/28968 co-relation queries the response was YES. [2024-06-20 19:42:06,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3325 conditions, 565 events. 290/565 cut-off events. For 28968/28968 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2578 event pairs, 55 based on Foata normal form. 8/572 useless extension candidates. Maximal degree in co-relation 3263. Up to 323 conditions per place. [2024-06-20 19:42:06,246 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 83 selfloop transitions, 30 changer transitions 7/122 dead transitions. [2024-06-20 19:42:06,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 122 transitions, 1210 flow [2024-06-20 19:42:06,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 126 transitions. [2024-06-20 19:42:06,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-06-20 19:42:06,248 INFO L175 Difference]: Start difference. First operand has 133 places, 94 transitions, 783 flow. Second operand 10 states and 126 transitions. [2024-06-20 19:42:06,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 122 transitions, 1210 flow [2024-06-20 19:42:06,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 1112 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:06,278 INFO L231 Difference]: Finished difference. Result has 126 places, 92 transitions, 742 flow [2024-06-20 19:42:06,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=742, PETRI_PLACES=126, PETRI_TRANSITIONS=92} [2024-06-20 19:42:06,279 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 97 predicate places. [2024-06-20 19:42:06,279 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 92 transitions, 742 flow [2024-06-20 19:42:06,279 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-20 19:42:06,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:06,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:06,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-20 19:42:06,280 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:06,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:06,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1594937454, now seen corresponding path program 1 times [2024-06-20 19:42:06,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:06,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702458530] [2024-06-20 19:42:06,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:06,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:11,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:11,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702458530] [2024-06-20 19:42:11,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702458530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:11,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:11,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:42:11,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040420621] [2024-06-20 19:42:11,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:11,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:42:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:11,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:42:11,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:42:11,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:11,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 92 transitions, 742 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-20 19:42:11,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:11,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:11,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:12,223 INFO L124 PetriNetUnfolderBase]: 276/535 cut-off events. [2024-06-20 19:42:12,223 INFO L125 PetriNetUnfolderBase]: For 21015/21015 co-relation queries the response was YES. [2024-06-20 19:42:12,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3098 conditions, 535 events. 276/535 cut-off events. For 21015/21015 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2371 event pairs, 58 based on Foata normal form. 2/536 useless extension candidates. Maximal degree in co-relation 3039. Up to 382 conditions per place. [2024-06-20 19:42:12,226 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 73 selfloop transitions, 35 changer transitions 0/110 dead transitions. [2024-06-20 19:42:12,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 110 transitions, 1017 flow [2024-06-20 19:42:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:42:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:42:12,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2024-06-20 19:42:12,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3962962962962963 [2024-06-20 19:42:12,227 INFO L175 Difference]: Start difference. First operand has 126 places, 92 transitions, 742 flow. Second operand 9 states and 107 transitions. [2024-06-20 19:42:12,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 110 transitions, 1017 flow [2024-06-20 19:42:12,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 110 transitions, 955 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:12,249 INFO L231 Difference]: Finished difference. Result has 125 places, 94 transitions, 778 flow [2024-06-20 19:42:12,250 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=778, PETRI_PLACES=125, PETRI_TRANSITIONS=94} [2024-06-20 19:42:12,250 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2024-06-20 19:42:12,250 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 94 transitions, 778 flow [2024-06-20 19:42:12,250 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-20 19:42:12,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:12,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:12,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-20 19:42:12,251 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:12,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:12,251 INFO L85 PathProgramCache]: Analyzing trace with hash 528219950, now seen corresponding path program 14 times [2024-06-20 19:42:12,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:12,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924343904] [2024-06-20 19:42:12,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:12,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:17,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-20 19:42:17,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:17,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924343904] [2024-06-20 19:42:17,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924343904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:17,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:17,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:42:17,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236926191] [2024-06-20 19:42:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:17,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:42:17,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:17,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:42:17,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:42:17,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:17,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 94 transitions, 778 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-20 19:42:17,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:17,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:17,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:17,985 INFO L124 PetriNetUnfolderBase]: 263/512 cut-off events. [2024-06-20 19:42:17,986 INFO L125 PetriNetUnfolderBase]: For 18753/18753 co-relation queries the response was YES. [2024-06-20 19:42:17,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 512 events. 263/512 cut-off events. For 18753/18753 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2266 event pairs, 46 based on Foata normal form. 10/521 useless extension candidates. Maximal degree in co-relation 2635. Up to 331 conditions per place. [2024-06-20 19:42:17,988 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 74 selfloop transitions, 27 changer transitions 13/116 dead transitions. [2024-06-20 19:42:17,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 116 transitions, 1080 flow [2024-06-20 19:42:17,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2024-06-20 19:42:17,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:42:17,989 INFO L175 Difference]: Start difference. First operand has 125 places, 94 transitions, 778 flow. Second operand 10 states and 120 transitions. [2024-06-20 19:42:17,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 116 transitions, 1080 flow [2024-06-20 19:42:18,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 116 transitions, 1002 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-20 19:42:18,007 INFO L231 Difference]: Finished difference. Result has 129 places, 90 transitions, 719 flow [2024-06-20 19:42:18,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=719, PETRI_PLACES=129, PETRI_TRANSITIONS=90} [2024-06-20 19:42:18,007 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 100 predicate places. [2024-06-20 19:42:18,007 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 90 transitions, 719 flow [2024-06-20 19:42:18,007 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-20 19:42:18,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:18,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:18,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-20 19:42:18,008 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:18,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash 701120404, now seen corresponding path program 2 times [2024-06-20 19:42:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183106279] [2024-06-20 19:42:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183106279] [2024-06-20 19:42:23,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183106279] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:23,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:23,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:23,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678126274] [2024-06-20 19:42:23,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:23,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:23,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:23,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:23,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:23,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 90 transitions, 719 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:23,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:23,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:24,408 INFO L124 PetriNetUnfolderBase]: 244/475 cut-off events. [2024-06-20 19:42:24,408 INFO L125 PetriNetUnfolderBase]: For 14659/14659 co-relation queries the response was YES. [2024-06-20 19:42:24,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2543 conditions, 475 events. 244/475 cut-off events. For 14659/14659 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2043 event pairs, 44 based on Foata normal form. 2/476 useless extension candidates. Maximal degree in co-relation 2483. Up to 335 conditions per place. [2024-06-20 19:42:24,410 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 82 selfloop transitions, 26 changer transitions 0/110 dead transitions. [2024-06-20 19:42:24,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 110 transitions, 1008 flow [2024-06-20 19:42:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-20 19:42:24,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-20 19:42:24,411 INFO L175 Difference]: Start difference. First operand has 129 places, 90 transitions, 719 flow. Second operand 12 states and 128 transitions. [2024-06-20 19:42:24,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 110 transitions, 1008 flow [2024-06-20 19:42:24,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 110 transitions, 946 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-06-20 19:42:24,430 INFO L231 Difference]: Finished difference. Result has 127 places, 93 transitions, 749 flow [2024-06-20 19:42:24,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=749, PETRI_PLACES=127, PETRI_TRANSITIONS=93} [2024-06-20 19:42:24,430 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2024-06-20 19:42:24,431 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 93 transitions, 749 flow [2024-06-20 19:42:24,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:24,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:24,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-20 19:42:24,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-20 19:42:24,431 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:24,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:24,431 INFO L85 PathProgramCache]: Analyzing trace with hash 694633654, now seen corresponding path program 3 times [2024-06-20 19:42:24,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:24,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969605326] [2024-06-20 19:42:24,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:24,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969605326] [2024-06-20 19:42:30,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969605326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182247050] [2024-06-20 19:42:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:30,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:30,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:30,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:30,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:30,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 93 transitions, 749 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:30,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:30,746 INFO L124 PetriNetUnfolderBase]: 248/483 cut-off events. [2024-06-20 19:42:30,746 INFO L125 PetriNetUnfolderBase]: For 13161/13161 co-relation queries the response was YES. [2024-06-20 19:42:30,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2551 conditions, 483 events. 248/483 cut-off events. For 13161/13161 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2089 event pairs, 47 based on Foata normal form. 2/484 useless extension candidates. Maximal degree in co-relation 2492. Up to 326 conditions per place. [2024-06-20 19:42:30,748 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 78 selfloop transitions, 29 changer transitions 0/109 dead transitions. [2024-06-20 19:42:30,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 109 transitions, 1015 flow [2024-06-20 19:42:30,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:42:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:42:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2024-06-20 19:42:30,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-06-20 19:42:30,750 INFO L175 Difference]: Start difference. First operand has 127 places, 93 transitions, 749 flow. Second operand 10 states and 114 transitions. [2024-06-20 19:42:30,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 109 transitions, 1015 flow [2024-06-20 19:42:30,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 109 transitions, 951 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-20 19:42:30,768 INFO L231 Difference]: Finished difference. Result has 129 places, 94 transitions, 761 flow [2024-06-20 19:42:30,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=761, PETRI_PLACES=129, PETRI_TRANSITIONS=94} [2024-06-20 19:42:30,768 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 100 predicate places. [2024-06-20 19:42:30,768 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 94 transitions, 761 flow [2024-06-20 19:42:30,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:30,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:30,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:30,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-20 19:42:30,769 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:30,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash 694449080, now seen corresponding path program 15 times [2024-06-20 19:42:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765508154] [2024-06-20 19:42:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:36,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765508154] [2024-06-20 19:42:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765508154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:36,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925807247] [2024-06-20 19:42:36,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:36,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:36,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:36,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:36,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:36,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 94 transitions, 761 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:36,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:36,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:36,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:36,618 INFO L124 PetriNetUnfolderBase]: 289/570 cut-off events. [2024-06-20 19:42:36,618 INFO L125 PetriNetUnfolderBase]: For 23488/23488 co-relation queries the response was YES. [2024-06-20 19:42:36,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3174 conditions, 570 events. 289/570 cut-off events. For 23488/23488 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2629 event pairs, 54 based on Foata normal form. 8/577 useless extension candidates. Maximal degree in co-relation 3114. Up to 307 conditions per place. [2024-06-20 19:42:36,622 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 81 selfloop transitions, 29 changer transitions 7/119 dead transitions. [2024-06-20 19:42:36,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 119 transitions, 1157 flow [2024-06-20 19:42:36,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 132 transitions. [2024-06-20 19:42:36,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-06-20 19:42:36,623 INFO L175 Difference]: Start difference. First operand has 129 places, 94 transitions, 761 flow. Second operand 11 states and 132 transitions. [2024-06-20 19:42:36,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 119 transitions, 1157 flow [2024-06-20 19:42:36,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 119 transitions, 1091 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-20 19:42:36,645 INFO L231 Difference]: Finished difference. Result has 132 places, 92 transitions, 740 flow [2024-06-20 19:42:36,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=740, PETRI_PLACES=132, PETRI_TRANSITIONS=92} [2024-06-20 19:42:36,646 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 103 predicate places. [2024-06-20 19:42:36,646 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 92 transitions, 740 flow [2024-06-20 19:42:36,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:36,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:36,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-20 19:42:36,646 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:36,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:36,646 INFO L85 PathProgramCache]: Analyzing trace with hash 694453730, now seen corresponding path program 16 times [2024-06-20 19:42:36,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:36,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958690870] [2024-06-20 19:42:36,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:36,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:41,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:41,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958690870] [2024-06-20 19:42:41,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958690870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:41,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:41,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:41,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202395552] [2024-06-20 19:42:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:41,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:41,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:42,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:42,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 92 transitions, 740 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:42,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:42,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:42,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:42,427 INFO L124 PetriNetUnfolderBase]: 258/509 cut-off events. [2024-06-20 19:42:42,427 INFO L125 PetriNetUnfolderBase]: For 19717/19717 co-relation queries the response was YES. [2024-06-20 19:42:42,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 509 events. 258/509 cut-off events. For 19717/19717 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2262 event pairs, 52 based on Foata normal form. 10/518 useless extension candidates. Maximal degree in co-relation 2582. Up to 324 conditions per place. [2024-06-20 19:42:42,430 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 75 selfloop transitions, 22 changer transitions 13/112 dead transitions. [2024-06-20 19:42:42,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 112 transitions, 1028 flow [2024-06-20 19:42:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:42:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:42:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:42:42,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-20 19:42:42,431 INFO L175 Difference]: Start difference. First operand has 132 places, 92 transitions, 740 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:42:42,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 112 transitions, 1028 flow [2024-06-20 19:42:42,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 112 transitions, 968 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:42,452 INFO L231 Difference]: Finished difference. Result has 131 places, 88 transitions, 689 flow [2024-06-20 19:42:42,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=689, PETRI_PLACES=131, PETRI_TRANSITIONS=88} [2024-06-20 19:42:42,453 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 102 predicate places. [2024-06-20 19:42:42,453 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 88 transitions, 689 flow [2024-06-20 19:42:42,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:42,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:42,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:42,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-20 19:42:42,453 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:42,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash 701128774, now seen corresponding path program 4 times [2024-06-20 19:42:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830483462] [2024-06-20 19:42:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:47,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:47,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830483462] [2024-06-20 19:42:47,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830483462] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:47,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:47,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:42:47,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710019826] [2024-06-20 19:42:47,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:47,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:42:47,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:47,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:42:47,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:42:48,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:48,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 88 transitions, 689 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-20 19:42:48,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:48,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:48,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:48,555 INFO L124 PetriNetUnfolderBase]: 237/466 cut-off events. [2024-06-20 19:42:48,555 INFO L125 PetriNetUnfolderBase]: For 13937/13937 co-relation queries the response was YES. [2024-06-20 19:42:48,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2460 conditions, 466 events. 237/466 cut-off events. For 13937/13937 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1998 event pairs, 44 based on Foata normal form. 2/467 useless extension candidates. Maximal degree in co-relation 2400. Up to 300 conditions per place. [2024-06-20 19:42:48,557 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 75 selfloop transitions, 29 changer transitions 0/106 dead transitions. [2024-06-20 19:42:48,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 106 transitions, 953 flow [2024-06-20 19:42:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2024-06-20 19:42:48,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35555555555555557 [2024-06-20 19:42:48,558 INFO L175 Difference]: Start difference. First operand has 131 places, 88 transitions, 689 flow. Second operand 12 states and 128 transitions. [2024-06-20 19:42:48,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 106 transitions, 953 flow [2024-06-20 19:42:48,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 106 transitions, 903 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:48,582 INFO L231 Difference]: Finished difference. Result has 127 places, 89 transitions, 717 flow [2024-06-20 19:42:48,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=717, PETRI_PLACES=127, PETRI_TRANSITIONS=89} [2024-06-20 19:42:48,583 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 98 predicate places. [2024-06-20 19:42:48,583 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 89 transitions, 717 flow [2024-06-20 19:42:48,583 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-20 19:42:48,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:48,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:48,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-20 19:42:48,584 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:48,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 412482946, now seen corresponding path program 5 times [2024-06-20 19:42:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:48,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761487963] [2024-06-20 19:42:48,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:54,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761487963] [2024-06-20 19:42:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761487963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996803678] [2024-06-20 19:42:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:54,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:54,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:54,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:54,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:54,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:54,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 89 transitions, 717 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:54,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:54,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:54,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:42:54,521 INFO L124 PetriNetUnfolderBase]: 243/480 cut-off events. [2024-06-20 19:42:54,521 INFO L125 PetriNetUnfolderBase]: For 12590/12590 co-relation queries the response was YES. [2024-06-20 19:42:54,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 480 events. 243/480 cut-off events. For 12590/12590 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2090 event pairs, 44 based on Foata normal form. 2/481 useless extension candidates. Maximal degree in co-relation 2462. Up to 422 conditions per place. [2024-06-20 19:42:54,523 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 86 selfloop transitions, 21 changer transitions 0/109 dead transitions. [2024-06-20 19:42:54,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 109 transitions, 1012 flow [2024-06-20 19:42:54,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:42:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:42:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2024-06-20 19:42:54,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3527777777777778 [2024-06-20 19:42:54,524 INFO L175 Difference]: Start difference. First operand has 127 places, 89 transitions, 717 flow. Second operand 12 states and 127 transitions. [2024-06-20 19:42:54,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 109 transitions, 1012 flow [2024-06-20 19:42:54,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 109 transitions, 942 flow, removed 6 selfloop flow, removed 10 redundant places. [2024-06-20 19:42:54,539 INFO L231 Difference]: Finished difference. Result has 130 places, 92 transitions, 737 flow [2024-06-20 19:42:54,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=737, PETRI_PLACES=130, PETRI_TRANSITIONS=92} [2024-06-20 19:42:54,540 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2024-06-20 19:42:54,540 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 92 transitions, 737 flow [2024-06-20 19:42:54,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:54,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:42:54,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:42:54,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-20 19:42:54,540 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-20 19:42:54,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:42:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash -696180932, now seen corresponding path program 6 times [2024-06-20 19:42:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:42:54,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879243124] [2024-06-20 19:42:54,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:42:54,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:42:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:42:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:42:59,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:42:59,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879243124] [2024-06-20 19:42:59,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879243124] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:42:59,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:42:59,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:42:59,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382978804] [2024-06-20 19:42:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:42:59,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:42:59,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:42:59,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:42:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:42:59,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:42:59,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 92 transitions, 737 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:42:59,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:42:59,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:42:59,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:00,371 INFO L124 PetriNetUnfolderBase]: 249/494 cut-off events. [2024-06-20 19:43:00,371 INFO L125 PetriNetUnfolderBase]: For 13438/13438 co-relation queries the response was YES. [2024-06-20 19:43:00,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2576 conditions, 494 events. 249/494 cut-off events. For 13438/13438 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2198 event pairs, 44 based on Foata normal form. 2/495 useless extension candidates. Maximal degree in co-relation 2516. Up to 431 conditions per place. [2024-06-20 19:43:00,374 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 86 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2024-06-20 19:43:00,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 108 transitions, 1009 flow [2024-06-20 19:43:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:00,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:43:00,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-06-20 19:43:00,376 INFO L175 Difference]: Start difference. First operand has 130 places, 92 transitions, 737 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:43:00,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 108 transitions, 1009 flow [2024-06-20 19:43:00,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 108 transitions, 947 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:00,396 INFO L231 Difference]: Finished difference. Result has 132 places, 94 transitions, 745 flow [2024-06-20 19:43:00,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=745, PETRI_PLACES=132, PETRI_TRANSITIONS=94} [2024-06-20 19:43:00,396 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 103 predicate places. [2024-06-20 19:43:00,396 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 94 transitions, 745 flow [2024-06-20 19:43:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:00,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:00,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:00,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-20 19:43:00,397 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-20 19:43:00,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1334369074, now seen corresponding path program 7 times [2024-06-20 19:43:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223989200] [2024-06-20 19:43:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223989200] [2024-06-20 19:43:05,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223989200] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:43:05,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252442653] [2024-06-20 19:43:05,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:05,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:43:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:05,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:43:05,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:43:05,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:05,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 94 transitions, 745 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-20 19:43:05,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:05,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:05,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:05,884 INFO L124 PetriNetUnfolderBase]: 253/502 cut-off events. [2024-06-20 19:43:05,885 INFO L125 PetriNetUnfolderBase]: For 14233/14233 co-relation queries the response was YES. [2024-06-20 19:43:05,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 502 events. 253/502 cut-off events. For 14233/14233 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2257 event pairs, 46 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 2562. Up to 454 conditions per place. [2024-06-20 19:43:05,888 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 86 selfloop transitions, 20 changer transitions 0/108 dead transitions. [2024-06-20 19:43:05,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 108 transitions, 1009 flow [2024-06-20 19:43:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:05,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2024-06-20 19:43:05,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3566666666666667 [2024-06-20 19:43:05,889 INFO L175 Difference]: Start difference. First operand has 132 places, 94 transitions, 745 flow. Second operand 10 states and 107 transitions. [2024-06-20 19:43:05,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 108 transitions, 1009 flow [2024-06-20 19:43:05,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 108 transitions, 947 flow, removed 13 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:05,908 INFO L231 Difference]: Finished difference. Result has 132 places, 95 transitions, 750 flow [2024-06-20 19:43:05,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=750, PETRI_PLACES=132, PETRI_TRANSITIONS=95} [2024-06-20 19:43:05,909 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 103 predicate places. [2024-06-20 19:43:05,909 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 95 transitions, 750 flow [2024-06-20 19:43:05,909 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-20 19:43:05,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:05,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:05,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-20 19:43:05,909 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-20 19:43:05,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:05,910 INFO L85 PathProgramCache]: Analyzing trace with hash -665614976, now seen corresponding path program 8 times [2024-06-20 19:43:05,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:05,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027582592] [2024-06-20 19:43:05,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:05,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027582592] [2024-06-20 19:43:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027582592] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660132566] [2024-06-20 19:43:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:11,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:11,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:11,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:11,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 95 transitions, 750 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:11,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:11,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:11,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:12,233 INFO L124 PetriNetUnfolderBase]: 287/576 cut-off events. [2024-06-20 19:43:12,233 INFO L125 PetriNetUnfolderBase]: For 23776/23776 co-relation queries the response was YES. [2024-06-20 19:43:12,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 576 events. 287/576 cut-off events. For 23776/23776 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2692 event pairs, 58 based on Foata normal form. 8/583 useless extension candidates. Maximal degree in co-relation 3102. Up to 419 conditions per place. [2024-06-20 19:43:12,236 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 88 selfloop transitions, 22 changer transitions 7/119 dead transitions. [2024-06-20 19:43:12,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 119 transitions, 1160 flow [2024-06-20 19:43:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-20 19:43:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-20 19:43:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2024-06-20 19:43:12,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37222222222222223 [2024-06-20 19:43:12,237 INFO L175 Difference]: Start difference. First operand has 132 places, 95 transitions, 750 flow. Second operand 12 states and 134 transitions. [2024-06-20 19:43:12,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 119 transitions, 1160 flow [2024-06-20 19:43:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 119 transitions, 1105 flow, removed 9 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:12,262 INFO L231 Difference]: Finished difference. Result has 136 places, 93 transitions, 729 flow [2024-06-20 19:43:12,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=136, PETRI_TRANSITIONS=93} [2024-06-20 19:43:12,263 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 107 predicate places. [2024-06-20 19:43:12,263 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 93 transitions, 729 flow [2024-06-20 19:43:12,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:12,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:12,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-20 19:43:12,263 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-20 19:43:12,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash -695941922, now seen corresponding path program 9 times [2024-06-20 19:43:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446029898] [2024-06-20 19:43:12,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:12,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:17,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:17,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:17,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446029898] [2024-06-20 19:43:17,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446029898] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:17,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:17,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-20 19:43:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640211309] [2024-06-20 19:43:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-20 19:43:17,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:17,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-20 19:43:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-20 19:43:17,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:17,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 93 transitions, 729 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-20 19:43:17,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:17,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:17,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:17,879 INFO L124 PetriNetUnfolderBase]: 280/559 cut-off events. [2024-06-20 19:43:17,879 INFO L125 PetriNetUnfolderBase]: For 22872/22872 co-relation queries the response was YES. [2024-06-20 19:43:17,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3240 conditions, 559 events. 280/559 cut-off events. For 22872/22872 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2577 event pairs, 65 based on Foata normal form. 2/560 useless extension candidates. Maximal degree in co-relation 3182. Up to 490 conditions per place. [2024-06-20 19:43:17,882 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 89 selfloop transitions, 18 changer transitions 0/109 dead transitions. [2024-06-20 19:43:17,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 109 transitions, 1093 flow [2024-06-20 19:43:17,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:43:17,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-20 19:43:17,883 INFO L175 Difference]: Start difference. First operand has 136 places, 93 transitions, 729 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:43:17,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 109 transitions, 1093 flow [2024-06-20 19:43:17,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 109 transitions, 1043 flow, removed 4 selfloop flow, removed 11 redundant places. [2024-06-20 19:43:17,905 INFO L231 Difference]: Finished difference. Result has 133 places, 95 transitions, 769 flow [2024-06-20 19:43:17,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=133, PETRI_TRANSITIONS=95} [2024-06-20 19:43:17,906 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 104 predicate places. [2024-06-20 19:43:17,906 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 95 transitions, 769 flow [2024-06-20 19:43:17,906 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-20 19:43:17,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:17,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:17,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-20 19:43:17,907 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-20 19:43:17,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1049260834, now seen corresponding path program 10 times [2024-06-20 19:43:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:17,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159927791] [2024-06-20 19:43:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:22,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:22,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159927791] [2024-06-20 19:43:22,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159927791] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:22,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:22,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:22,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310922016] [2024-06-20 19:43:22,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:22,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:22,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:23,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:23,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 95 transitions, 769 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:23,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:23,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:23,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:23,534 INFO L124 PetriNetUnfolderBase]: 284/567 cut-off events. [2024-06-20 19:43:23,535 INFO L125 PetriNetUnfolderBase]: For 22044/22044 co-relation queries the response was YES. [2024-06-20 19:43:23,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3285 conditions, 567 events. 284/567 cut-off events. For 22044/22044 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2638 event pairs, 65 based on Foata normal form. 2/568 useless extension candidates. Maximal degree in co-relation 3228. Up to 503 conditions per place. [2024-06-20 19:43:23,537 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 87 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2024-06-20 19:43:23,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 109 transitions, 1037 flow [2024-06-20 19:43:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:23,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2024-06-20 19:43:23,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36 [2024-06-20 19:43:23,538 INFO L175 Difference]: Start difference. First operand has 133 places, 95 transitions, 769 flow. Second operand 10 states and 108 transitions. [2024-06-20 19:43:23,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 109 transitions, 1037 flow [2024-06-20 19:43:23,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 109 transitions, 963 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:23,560 INFO L231 Difference]: Finished difference. Result has 135 places, 96 transitions, 765 flow [2024-06-20 19:43:23,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=765, PETRI_PLACES=135, PETRI_TRANSITIONS=96} [2024-06-20 19:43:23,560 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2024-06-20 19:43:23,560 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 96 transitions, 765 flow [2024-06-20 19:43:23,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:23,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:23,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:23,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-20 19:43:23,561 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-20 19:43:23,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1334606658, now seen corresponding path program 17 times [2024-06-20 19:43:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792850735] [2024-06-20 19:43:23,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:23,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:28,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792850735] [2024-06-20 19:43:28,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792850735] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:28,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:28,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429467601] [2024-06-20 19:43:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:28,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:28,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:29,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:29,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 96 transitions, 765 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:29,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:29,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:29,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:29,414 INFO L124 PetriNetUnfolderBase]: 305/618 cut-off events. [2024-06-20 19:43:29,415 INFO L125 PetriNetUnfolderBase]: For 31768/31768 co-relation queries the response was YES. [2024-06-20 19:43:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 618 events. 305/618 cut-off events. For 31768/31768 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3013 event pairs, 74 based on Foata normal form. 18/635 useless extension candidates. Maximal degree in co-relation 3304. Up to 493 conditions per place. [2024-06-20 19:43:29,417 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 82 selfloop transitions, 17 changer transitions 14/115 dead transitions. [2024-06-20 19:43:29,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 115 transitions, 1055 flow [2024-06-20 19:43:29,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:43:29,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:43:29,418 INFO L175 Difference]: Start difference. First operand has 135 places, 96 transitions, 765 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:43:29,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 115 transitions, 1055 flow [2024-06-20 19:43:29,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 115 transitions, 995 flow, removed 11 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:29,443 INFO L231 Difference]: Finished difference. Result has 138 places, 90 transitions, 695 flow [2024-06-20 19:43:29,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=695, PETRI_PLACES=138, PETRI_TRANSITIONS=90} [2024-06-20 19:43:29,444 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 109 predicate places. [2024-06-20 19:43:29,444 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 90 transitions, 695 flow [2024-06-20 19:43:29,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:29,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:29,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:29,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-20 19:43:29,445 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-20 19:43:29,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash -672110096, now seen corresponding path program 11 times [2024-06-20 19:43:29,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105855871] [2024-06-20 19:43:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:34,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105855871] [2024-06-20 19:43:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105855871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87232405] [2024-06-20 19:43:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:34,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:34,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 90 transitions, 695 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:34,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:34,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:34,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:35,210 INFO L124 PetriNetUnfolderBase]: 259/528 cut-off events. [2024-06-20 19:43:35,211 INFO L125 PetriNetUnfolderBase]: For 20821/20821 co-relation queries the response was YES. [2024-06-20 19:43:35,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2936 conditions, 528 events. 259/528 cut-off events. For 20821/20821 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2454 event pairs, 57 based on Foata normal form. 2/529 useless extension candidates. Maximal degree in co-relation 2876. Up to 461 conditions per place. [2024-06-20 19:43:35,213 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 82 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2024-06-20 19:43:35,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 106 transitions, 969 flow [2024-06-20 19:43:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:35,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2024-06-20 19:43:35,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37333333333333335 [2024-06-20 19:43:35,214 INFO L175 Difference]: Start difference. First operand has 138 places, 90 transitions, 695 flow. Second operand 10 states and 112 transitions. [2024-06-20 19:43:35,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 106 transitions, 969 flow [2024-06-20 19:43:35,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 106 transitions, 917 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-20 19:43:35,245 INFO L231 Difference]: Finished difference. Result has 134 places, 91 transitions, 719 flow [2024-06-20 19:43:35,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=719, PETRI_PLACES=134, PETRI_TRANSITIONS=91} [2024-06-20 19:43:35,245 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2024-06-20 19:43:35,245 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 91 transitions, 719 flow [2024-06-20 19:43:35,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:35,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:35,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:35,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-20 19:43:35,246 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-20 19:43:35,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash -702437042, now seen corresponding path program 12 times [2024-06-20 19:43:35,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279600564] [2024-06-20 19:43:35,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279600564] [2024-06-20 19:43:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279600564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051811789] [2024-06-20 19:43:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:40,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:40,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:40,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 91 transitions, 719 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:40,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:40,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:40,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:41,043 INFO L124 PetriNetUnfolderBase]: 256/523 cut-off events. [2024-06-20 19:43:41,043 INFO L125 PetriNetUnfolderBase]: For 19056/19056 co-relation queries the response was YES. [2024-06-20 19:43:41,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2835 conditions, 523 events. 256/523 cut-off events. For 19056/19056 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2423 event pairs, 60 based on Foata normal form. 2/524 useless extension candidates. Maximal degree in co-relation 2776. Up to 460 conditions per place. [2024-06-20 19:43:41,046 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 83 selfloop transitions, 20 changer transitions 0/105 dead transitions. [2024-06-20 19:43:41,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 105 transitions, 961 flow [2024-06-20 19:43:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:43:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:43:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:43:41,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-06-20 19:43:41,048 INFO L175 Difference]: Start difference. First operand has 134 places, 91 transitions, 719 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:43:41,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 105 transitions, 961 flow [2024-06-20 19:43:41,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 105 transitions, 879 flow, removed 20 selfloop flow, removed 8 redundant places. [2024-06-20 19:43:41,076 INFO L231 Difference]: Finished difference. Result has 136 places, 91 transitions, 681 flow [2024-06-20 19:43:41,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=681, PETRI_PLACES=136, PETRI_TRANSITIONS=91} [2024-06-20 19:43:41,077 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 107 predicate places. [2024-06-20 19:43:41,077 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 91 transitions, 681 flow [2024-06-20 19:43:41,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:41,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:41,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:41,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-20 19:43:41,077 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-20 19:43:41,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash -672290020, now seen corresponding path program 18 times [2024-06-20 19:43:41,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826974626] [2024-06-20 19:43:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:46,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:46,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826974626] [2024-06-20 19:43:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826974626] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:46,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525576127] [2024-06-20 19:43:46,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:46,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:46,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:46,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:46,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:46,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 91 transitions, 681 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:46,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:46,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:46,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:46,973 INFO L124 PetriNetUnfolderBase]: 272/559 cut-off events. [2024-06-20 19:43:46,973 INFO L125 PetriNetUnfolderBase]: For 26191/26191 co-relation queries the response was YES. [2024-06-20 19:43:46,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2888 conditions, 559 events. 272/559 cut-off events. For 26191/26191 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2674 event pairs, 62 based on Foata normal form. 10/568 useless extension candidates. Maximal degree in co-relation 2828. Up to 447 conditions per place. [2024-06-20 19:43:46,994 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 77 selfloop transitions, 21 changer transitions 11/111 dead transitions. [2024-06-20 19:43:46,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 111 transitions, 967 flow [2024-06-20 19:43:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:46,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:43:46,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-20 19:43:46,995 INFO L175 Difference]: Start difference. First operand has 136 places, 91 transitions, 681 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:43:46,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 111 transitions, 967 flow [2024-06-20 19:43:47,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 111 transitions, 920 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:43:47,022 INFO L231 Difference]: Finished difference. Result has 138 places, 88 transitions, 659 flow [2024-06-20 19:43:47,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=659, PETRI_PLACES=138, PETRI_TRANSITIONS=88} [2024-06-20 19:43:47,023 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 109 predicate places. [2024-06-20 19:43:47,023 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 88 transitions, 659 flow [2024-06-20 19:43:47,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:47,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:47,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:47,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-20 19:43:47,023 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-20 19:43:47,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -672294670, now seen corresponding path program 19 times [2024-06-20 19:43:47,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:47,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391557446] [2024-06-20 19:43:47,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:47,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:52,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391557446] [2024-06-20 19:43:52,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391557446] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:52,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:52,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:52,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415620622] [2024-06-20 19:43:52,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:52,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:52,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:52,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:52,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:52,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:52,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 88 transitions, 659 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:52,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:52,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:52,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:53,159 INFO L124 PetriNetUnfolderBase]: 260/539 cut-off events. [2024-06-20 19:43:53,159 INFO L125 PetriNetUnfolderBase]: For 25818/25818 co-relation queries the response was YES. [2024-06-20 19:43:53,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2830 conditions, 539 events. 260/539 cut-off events. For 25818/25818 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2556 event pairs, 60 based on Foata normal form. 8/546 useless extension candidates. Maximal degree in co-relation 2770. Up to 393 conditions per place. [2024-06-20 19:43:53,162 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 83 selfloop transitions, 16 changer transitions 9/110 dead transitions. [2024-06-20 19:43:53,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 110 transitions, 1025 flow [2024-06-20 19:43:53,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:53,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 125 transitions. [2024-06-20 19:43:53,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3787878787878788 [2024-06-20 19:43:53,163 INFO L175 Difference]: Start difference. First operand has 138 places, 88 transitions, 659 flow. Second operand 11 states and 125 transitions. [2024-06-20 19:43:53,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 110 transitions, 1025 flow [2024-06-20 19:43:53,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 110 transitions, 975 flow, removed 4 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:53,191 INFO L231 Difference]: Finished difference. Result has 136 places, 85 transitions, 628 flow [2024-06-20 19:43:53,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=628, PETRI_PLACES=136, PETRI_TRANSITIONS=85} [2024-06-20 19:43:53,191 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 107 predicate places. [2024-06-20 19:43:53,192 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 85 transitions, 628 flow [2024-06-20 19:43:53,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:53,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:53,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:53,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-20 19:43:53,192 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-20 19:43:53,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash -702616966, now seen corresponding path program 20 times [2024-06-20 19:43:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:53,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943083641] [2024-06-20 19:43:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:43:58,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:43:58,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:43:58,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943083641] [2024-06-20 19:43:58,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943083641] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:43:58,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:43:58,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:43:58,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520960688] [2024-06-20 19:43:58,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:43:58,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:43:58,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:43:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:43:58,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:43:58,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:43:58,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 85 transitions, 628 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:58,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:43:58,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:43:58,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:43:58,600 INFO L124 PetriNetUnfolderBase]: 250/521 cut-off events. [2024-06-20 19:43:58,601 INFO L125 PetriNetUnfolderBase]: For 24588/24588 co-relation queries the response was YES. [2024-06-20 19:43:58,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2655 conditions, 521 events. 250/521 cut-off events. For 24588/24588 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2429 event pairs, 65 based on Foata normal form. 10/530 useless extension candidates. Maximal degree in co-relation 2596. Up to 430 conditions per place. [2024-06-20 19:43:58,604 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 76 selfloop transitions, 15 changer transitions 11/104 dead transitions. [2024-06-20 19:43:58,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 104 transitions, 896 flow [2024-06-20 19:43:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:43:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:43:58,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 121 transitions. [2024-06-20 19:43:58,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-20 19:43:58,605 INFO L175 Difference]: Start difference. First operand has 136 places, 85 transitions, 628 flow. Second operand 11 states and 121 transitions. [2024-06-20 19:43:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 104 transitions, 896 flow [2024-06-20 19:43:58,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 104 transitions, 860 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:43:58,626 INFO L231 Difference]: Finished difference. Result has 133 places, 82 transitions, 605 flow [2024-06-20 19:43:58,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=605, PETRI_PLACES=133, PETRI_TRANSITIONS=82} [2024-06-20 19:43:58,626 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 104 predicate places. [2024-06-20 19:43:58,626 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 82 transitions, 605 flow [2024-06-20 19:43:58,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:43:58,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:43:58,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:43:58,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-20 19:43:58,626 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-20 19:43:58,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:43:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 257736566, now seen corresponding path program 13 times [2024-06-20 19:43:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:43:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235035728] [2024-06-20 19:43:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:43:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:43:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:04,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:04,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235035728] [2024-06-20 19:44:04,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235035728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:04,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:04,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012708421] [2024-06-20 19:44:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:04,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:04,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:04,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:04,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:04,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 82 transitions, 605 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:04,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:04,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:04,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:04,497 INFO L124 PetriNetUnfolderBase]: 223/468 cut-off events. [2024-06-20 19:44:04,498 INFO L125 PetriNetUnfolderBase]: For 15443/15443 co-relation queries the response was YES. [2024-06-20 19:44:04,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 468 events. 223/468 cut-off events. For 15443/15443 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2119 event pairs, 58 based on Foata normal form. 2/469 useless extension candidates. Maximal degree in co-relation 2280. Up to 426 conditions per place. [2024-06-20 19:44:04,500 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 79 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2024-06-20 19:44:04,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 95 transitions, 819 flow [2024-06-20 19:44:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:44:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:44:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 104 transitions. [2024-06-20 19:44:04,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3466666666666667 [2024-06-20 19:44:04,501 INFO L175 Difference]: Start difference. First operand has 133 places, 82 transitions, 605 flow. Second operand 10 states and 104 transitions. [2024-06-20 19:44:04,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 95 transitions, 819 flow [2024-06-20 19:44:04,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 95 transitions, 785 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:44:04,521 INFO L231 Difference]: Finished difference. Result has 130 places, 82 transitions, 603 flow [2024-06-20 19:44:04,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=603, PETRI_PLACES=130, PETRI_TRANSITIONS=82} [2024-06-20 19:44:04,521 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 101 predicate places. [2024-06-20 19:44:04,522 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 82 transitions, 603 flow [2024-06-20 19:44:04,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:04,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:04,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:44:04,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-20 19:44:04,522 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-20 19:44:04,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:04,522 INFO L85 PathProgramCache]: Analyzing trace with hash -702621616, now seen corresponding path program 21 times [2024-06-20 19:44:04,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:04,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309892972] [2024-06-20 19:44:04,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:04,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:10,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:10,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309892972] [2024-06-20 19:44:10,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309892972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:10,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954527020] [2024-06-20 19:44:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:10,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:10,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:10,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 82 transitions, 603 flow. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:10,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:10,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:10,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:10,724 INFO L124 PetriNetUnfolderBase]: 213/450 cut-off events. [2024-06-20 19:44:10,725 INFO L125 PetriNetUnfolderBase]: For 13326/13326 co-relation queries the response was YES. [2024-06-20 19:44:10,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 450 events. 213/450 cut-off events. For 13326/13326 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2032 event pairs, 40 based on Foata normal form. 8/457 useless extension candidates. Maximal degree in co-relation 1928. Up to 352 conditions per place. [2024-06-20 19:44:10,727 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 69 selfloop transitions, 17 changer transitions 11/99 dead transitions. [2024-06-20 19:44:10,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 99 transitions, 839 flow [2024-06-20 19:44:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:10,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 119 transitions. [2024-06-20 19:44:10,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2024-06-20 19:44:10,728 INFO L175 Difference]: Start difference. First operand has 130 places, 82 transitions, 603 flow. Second operand 11 states and 119 transitions. [2024-06-20 19:44:10,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 99 transitions, 839 flow [2024-06-20 19:44:10,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 99 transitions, 777 flow, removed 14 selfloop flow, removed 9 redundant places. [2024-06-20 19:44:10,741 INFO L231 Difference]: Finished difference. Result has 132 places, 78 transitions, 544 flow [2024-06-20 19:44:10,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=544, PETRI_PLACES=132, PETRI_TRANSITIONS=78} [2024-06-20 19:44:10,741 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 103 predicate places. [2024-06-20 19:44:10,742 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 78 transitions, 544 flow [2024-06-20 19:44:10,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:10,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:10,742 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-20 19:44:10,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-20 19:44:10,742 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-20 19:44:10,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 535119069, now seen corresponding path program 1 times [2024-06-20 19:44:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:10,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954324631] [2024-06-20 19:44:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:10,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:16,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:16,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954324631] [2024-06-20 19:44:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954324631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:16,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:16,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:16,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251274599] [2024-06-20 19:44:16,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:16,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:17,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:17,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 78 transitions, 544 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-20 19:44:17,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:17,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:17,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:17,422 INFO L124 PetriNetUnfolderBase]: 202/429 cut-off events. [2024-06-20 19:44:17,422 INFO L125 PetriNetUnfolderBase]: For 12523/12523 co-relation queries the response was YES. [2024-06-20 19:44:17,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 429 events. 202/429 cut-off events. For 12523/12523 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1914 event pairs, 43 based on Foata normal form. 6/434 useless extension candidates. Maximal degree in co-relation 1791. Up to 234 conditions per place. [2024-06-20 19:44:17,424 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 59 selfloop transitions, 25 changer transitions 7/93 dead transitions. [2024-06-20 19:44:17,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 93 transitions, 764 flow [2024-06-20 19:44:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:44:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:44:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 110 transitions. [2024-06-20 19:44:17,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36666666666666664 [2024-06-20 19:44:17,425 INFO L175 Difference]: Start difference. First operand has 132 places, 78 transitions, 544 flow. Second operand 10 states and 110 transitions. [2024-06-20 19:44:17,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 93 transitions, 764 flow [2024-06-20 19:44:17,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 93 transitions, 694 flow, removed 5 selfloop flow, removed 13 redundant places. [2024-06-20 19:44:17,438 INFO L231 Difference]: Finished difference. Result has 122 places, 75 transitions, 512 flow [2024-06-20 19:44:17,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=512, PETRI_PLACES=122, PETRI_TRANSITIONS=75} [2024-06-20 19:44:17,438 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 93 predicate places. [2024-06-20 19:44:17,438 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 75 transitions, 512 flow [2024-06-20 19:44:17,438 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-20 19:44:17,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:17,439 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-20 19:44:17,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-20 19:44:17,439 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-20 19:44:17,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash 58807623, now seen corresponding path program 2 times [2024-06-20 19:44:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272659412] [2024-06-20 19:44:17,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272659412] [2024-06-20 19:44:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272659412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:44:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008411860] [2024-06-20 19:44:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:44:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:44:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:44:23,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:23,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 75 transitions, 512 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:23,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:23,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:23,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:23,858 INFO L124 PetriNetUnfolderBase]: 188/398 cut-off events. [2024-06-20 19:44:23,858 INFO L125 PetriNetUnfolderBase]: For 11221/11221 co-relation queries the response was YES. [2024-06-20 19:44:23,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 398 events. 188/398 cut-off events. For 11221/11221 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1724 event pairs, 44 based on Foata normal form. 6/403 useless extension candidates. Maximal degree in co-relation 1625. Up to 247 conditions per place. [2024-06-20 19:44:23,860 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 62 selfloop transitions, 18 changer transitions 12/94 dead transitions. [2024-06-20 19:44:23,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 94 transitions, 746 flow [2024-06-20 19:44:23,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 120 transitions. [2024-06-20 19:44:23,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-06-20 19:44:23,861 INFO L175 Difference]: Start difference. First operand has 122 places, 75 transitions, 512 flow. Second operand 11 states and 120 transitions. [2024-06-20 19:44:23,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 94 transitions, 746 flow [2024-06-20 19:44:23,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 94 transitions, 642 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-20 19:44:23,871 INFO L231 Difference]: Finished difference. Result has 120 places, 71 transitions, 430 flow [2024-06-20 19:44:23,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=430, PETRI_PLACES=120, PETRI_TRANSITIONS=71} [2024-06-20 19:44:23,871 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 91 predicate places. [2024-06-20 19:44:23,871 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 71 transitions, 430 flow [2024-06-20 19:44:23,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:23,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:23,871 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-20 19:44:23,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-20 19:44:23,872 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-20 19:44:23,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2096547307, now seen corresponding path program 3 times [2024-06-20 19:44:23,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:23,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840723116] [2024-06-20 19:44:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:29,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:29,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:29,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840723116] [2024-06-20 19:44:29,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840723116] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:29,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:29,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:44:29,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058262548] [2024-06-20 19:44:29,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:29,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:44:29,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:29,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:44:29,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:44:29,973 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:29,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 71 transitions, 430 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-20 19:44:29,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:29,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:29,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:30,287 INFO L124 PetriNetUnfolderBase]: 179/379 cut-off events. [2024-06-20 19:44:30,287 INFO L125 PetriNetUnfolderBase]: For 11131/11131 co-relation queries the response was YES. [2024-06-20 19:44:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 379 events. 179/379 cut-off events. For 11131/11131 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1620 event pairs, 40 based on Foata normal form. 6/384 useless extension candidates. Maximal degree in co-relation 1492. Up to 237 conditions per place. [2024-06-20 19:44:30,288 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 53 selfloop transitions, 18 changer transitions 15/88 dead transitions. [2024-06-20 19:44:30,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 88 transitions, 646 flow [2024-06-20 19:44:30,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-20 19:44:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-20 19:44:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 109 transitions. [2024-06-20 19:44:30,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-06-20 19:44:30,289 INFO L175 Difference]: Start difference. First operand has 120 places, 71 transitions, 430 flow. Second operand 10 states and 109 transitions. [2024-06-20 19:44:30,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 88 transitions, 646 flow [2024-06-20 19:44:30,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 88 transitions, 606 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-20 19:44:30,299 INFO L231 Difference]: Finished difference. Result has 115 places, 65 transitions, 403 flow [2024-06-20 19:44:30,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=115, PETRI_TRANSITIONS=65} [2024-06-20 19:44:30,300 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2024-06-20 19:44:30,300 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 65 transitions, 403 flow [2024-06-20 19:44:30,300 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-20 19:44:30,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:30,300 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-20 19:44:30,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-20 19:44:30,300 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-20 19:44:30,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2019386223, now seen corresponding path program 4 times [2024-06-20 19:44:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377247980] [2024-06-20 19:44:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:36,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-20 19:44:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377247980] [2024-06-20 19:44:36,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377247980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:36,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:44:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609057429] [2024-06-20 19:44:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:44:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:44:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:44:36,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:36,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 65 transitions, 403 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:36,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:36,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:36,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:36,916 INFO L124 PetriNetUnfolderBase]: 167/355 cut-off events. [2024-06-20 19:44:36,916 INFO L125 PetriNetUnfolderBase]: For 10517/10517 co-relation queries the response was YES. [2024-06-20 19:44:36,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1467 conditions, 355 events. 167/355 cut-off events. For 10517/10517 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1485 event pairs, 44 based on Foata normal form. 6/360 useless extension candidates. Maximal degree in co-relation 1416. Up to 227 conditions per place. [2024-06-20 19:44:36,917 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 55 selfloop transitions, 15 changer transitions 11/83 dead transitions. [2024-06-20 19:44:36,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 83 transitions, 611 flow [2024-06-20 19:44:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2024-06-20 19:44:36,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3515151515151515 [2024-06-20 19:44:36,918 INFO L175 Difference]: Start difference. First operand has 115 places, 65 transitions, 403 flow. Second operand 11 states and 116 transitions. [2024-06-20 19:44:36,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 83 transitions, 611 flow [2024-06-20 19:44:36,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 83 transitions, 567 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:44:36,928 INFO L231 Difference]: Finished difference. Result has 109 places, 62 transitions, 378 flow [2024-06-20 19:44:36,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=378, PETRI_PLACES=109, PETRI_TRANSITIONS=62} [2024-06-20 19:44:36,928 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2024-06-20 19:44:36,928 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 62 transitions, 378 flow [2024-06-20 19:44:36,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:36,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:36,928 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-20 19:44:36,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-20 19:44:36,929 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-20 19:44:36,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 260156343, now seen corresponding path program 5 times [2024-06-20 19:44:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158135669] [2024-06-20 19:44:36,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158135669] [2024-06-20 19:44:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158135669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:44:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462233416] [2024-06-20 19:44:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:43,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:44:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:44:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:44:43,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:43,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 62 transitions, 378 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:43,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:43,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:43,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:43,990 INFO L124 PetriNetUnfolderBase]: 157/337 cut-off events. [2024-06-20 19:44:43,990 INFO L125 PetriNetUnfolderBase]: For 8739/8739 co-relation queries the response was YES. [2024-06-20 19:44:43,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 337 events. 157/337 cut-off events. For 8739/8739 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1385 event pairs, 43 based on Foata normal form. 6/342 useless extension candidates. Maximal degree in co-relation 1318. Up to 192 conditions per place. [2024-06-20 19:44:43,992 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 42 selfloop transitions, 13 changer transitions 22/79 dead transitions. [2024-06-20 19:44:43,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 79 transitions, 572 flow [2024-06-20 19:44:43,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:43,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:43,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2024-06-20 19:44:43,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3484848484848485 [2024-06-20 19:44:43,993 INFO L175 Difference]: Start difference. First operand has 109 places, 62 transitions, 378 flow. Second operand 11 states and 115 transitions. [2024-06-20 19:44:43,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 79 transitions, 572 flow [2024-06-20 19:44:44,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 79 transitions, 536 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:44:44,002 INFO L231 Difference]: Finished difference. Result has 105 places, 55 transitions, 340 flow [2024-06-20 19:44:44,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=340, PETRI_PLACES=105, PETRI_TRANSITIONS=55} [2024-06-20 19:44:44,003 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 76 predicate places. [2024-06-20 19:44:44,003 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 55 transitions, 340 flow [2024-06-20 19:44:44,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:44,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:44,003 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-20 19:44:44,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-20 19:44:44,003 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-20 19:44:44,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash -97929733, now seen corresponding path program 6 times [2024-06-20 19:44:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:44,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291043193] [2024-06-20 19:44:44,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:49,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:49,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291043193] [2024-06-20 19:44:49,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291043193] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:49,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:49,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:44:49,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941876592] [2024-06-20 19:44:49,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:49,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:44:49,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:49,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:44:49,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:44:50,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:50,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 55 transitions, 340 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:50,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:50,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:50,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:50,512 INFO L124 PetriNetUnfolderBase]: 139/298 cut-off events. [2024-06-20 19:44:50,512 INFO L125 PetriNetUnfolderBase]: For 7650/7650 co-relation queries the response was YES. [2024-06-20 19:44:50,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 298 events. 139/298 cut-off events. For 7650/7650 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 36 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 1182. Up to 216 conditions per place. [2024-06-20 19:44:50,513 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 44 selfloop transitions, 13 changer transitions 14/73 dead transitions. [2024-06-20 19:44:50,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 73 transitions, 528 flow [2024-06-20 19:44:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-20 19:44:50,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-20 19:44:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2024-06-20 19:44:50,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33076923076923076 [2024-06-20 19:44:50,514 INFO L175 Difference]: Start difference. First operand has 105 places, 55 transitions, 340 flow. Second operand 13 states and 129 transitions. [2024-06-20 19:44:50,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 73 transitions, 528 flow [2024-06-20 19:44:50,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 73 transitions, 488 flow, removed 6 selfloop flow, removed 11 redundant places. [2024-06-20 19:44:50,520 INFO L231 Difference]: Finished difference. Result has 95 places, 51 transitions, 310 flow [2024-06-20 19:44:50,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=310, PETRI_PLACES=95, PETRI_TRANSITIONS=51} [2024-06-20 19:44:50,520 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2024-06-20 19:44:50,521 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 51 transitions, 310 flow [2024-06-20 19:44:50,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:50,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:50,521 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-20 19:44:50,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-20 19:44:50,521 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-20 19:44:50,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:50,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1032977837, now seen corresponding path program 7 times [2024-06-20 19:44:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:50,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762371372] [2024-06-20 19:44:50,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:44:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:44:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:44:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762371372] [2024-06-20 19:44:56,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762371372] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:44:56,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:44:56,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:44:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904284643] [2024-06-20 19:44:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:44:56,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:44:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:44:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:44:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:44:57,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:44:57,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 51 transitions, 310 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:57,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:44:57,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:44:57,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:44:57,507 INFO L124 PetriNetUnfolderBase]: 112/241 cut-off events. [2024-06-20 19:44:57,507 INFO L125 PetriNetUnfolderBase]: For 3528/3528 co-relation queries the response was YES. [2024-06-20 19:44:57,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 241 events. 112/241 cut-off events. For 3528/3528 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 872 event pairs, 21 based on Foata normal form. 6/247 useless extension candidates. Maximal degree in co-relation 838. Up to 164 conditions per place. [2024-06-20 19:44:57,508 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 36 selfloop transitions, 11 changer transitions 16/65 dead transitions. [2024-06-20 19:44:57,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 65 transitions, 470 flow [2024-06-20 19:44:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:44:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:44:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2024-06-20 19:44:57,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33636363636363636 [2024-06-20 19:44:57,509 INFO L175 Difference]: Start difference. First operand has 95 places, 51 transitions, 310 flow. Second operand 11 states and 111 transitions. [2024-06-20 19:44:57,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 65 transitions, 470 flow [2024-06-20 19:44:57,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 65 transitions, 440 flow, removed 2 selfloop flow, removed 10 redundant places. [2024-06-20 19:44:57,513 INFO L231 Difference]: Finished difference. Result has 89 places, 45 transitions, 274 flow [2024-06-20 19:44:57,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=274, PETRI_PLACES=89, PETRI_TRANSITIONS=45} [2024-06-20 19:44:57,514 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-06-20 19:44:57,514 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 45 transitions, 274 flow [2024-06-20 19:44:57,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:44:57,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:44:57,514 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-20 19:44:57,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-20 19:44:57,515 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-20 19:44:57,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:44:57,515 INFO L85 PathProgramCache]: Analyzing trace with hash -300710993, now seen corresponding path program 8 times [2024-06-20 19:44:57,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:44:57,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819055304] [2024-06-20 19:44:57,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:44:57,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:44:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:04,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:04,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:04,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819055304] [2024-06-20 19:45:04,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819055304] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:04,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:04,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:45:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078806651] [2024-06-20 19:45:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:04,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:45:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:45:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:45:04,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:04,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 45 transitions, 274 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:04,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:04,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:04,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:04,685 INFO L124 PetriNetUnfolderBase]: 101/216 cut-off events. [2024-06-20 19:45:04,685 INFO L125 PetriNetUnfolderBase]: For 3266/3266 co-relation queries the response was YES. [2024-06-20 19:45:04,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 216 events. 101/216 cut-off events. For 3266/3266 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 750 event pairs, 23 based on Foata normal form. 6/222 useless extension candidates. Maximal degree in co-relation 754. Up to 146 conditions per place. [2024-06-20 19:45:04,686 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 37 selfloop transitions, 9 changer transitions 12/60 dead transitions. [2024-06-20 19:45:04,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 60 transitions, 428 flow [2024-06-20 19:45:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-20 19:45:04,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-20 19:45:04,687 INFO L175 Difference]: Start difference. First operand has 89 places, 45 transitions, 274 flow. Second operand 11 states and 109 transitions. [2024-06-20 19:45:04,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 60 transitions, 428 flow [2024-06-20 19:45:04,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 60 transitions, 396 flow, removed 5 selfloop flow, removed 10 redundant places. [2024-06-20 19:45:04,691 INFO L231 Difference]: Finished difference. Result has 78 places, 41 transitions, 244 flow [2024-06-20 19:45:04,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=41} [2024-06-20 19:45:04,691 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 49 predicate places. [2024-06-20 19:45:04,691 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 41 transitions, 244 flow [2024-06-20 19:45:04,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:04,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:04,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-20 19:45:04,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-20 19:45:04,692 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-20 19:45:04,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash -99621743, now seen corresponding path program 9 times [2024-06-20 19:45:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391808178] [2024-06-20 19:45:04,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:11,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:11,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:11,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391808178] [2024-06-20 19:45:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391808178] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:11,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:45:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721333288] [2024-06-20 19:45:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:11,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:45:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:11,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:45:11,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:45:11,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:11,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 41 transitions, 244 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:11,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:11,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:11,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:11,749 INFO L124 PetriNetUnfolderBase]: 92/197 cut-off events. [2024-06-20 19:45:11,750 INFO L125 PetriNetUnfolderBase]: For 2238/2238 co-relation queries the response was YES. [2024-06-20 19:45:11,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 705 conditions, 197 events. 92/197 cut-off events. For 2238/2238 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 640 event pairs, 23 based on Foata normal form. 6/203 useless extension candidates. Maximal degree in co-relation 670. Up to 119 conditions per place. [2024-06-20 19:45:11,750 INFO L140 encePairwiseOnDemand]: 19/30 looper letters, 31 selfloop transitions, 11 changer transitions 11/55 dead transitions. [2024-06-20 19:45:11,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 55 transitions, 384 flow [2024-06-20 19:45:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:11,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-20 19:45:11,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-20 19:45:11,752 INFO L175 Difference]: Start difference. First operand has 78 places, 41 transitions, 244 flow. Second operand 11 states and 109 transitions. [2024-06-20 19:45:11,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 55 transitions, 384 flow [2024-06-20 19:45:11,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 55 transitions, 356 flow, removed 2 selfloop flow, removed 11 redundant places. [2024-06-20 19:45:11,755 INFO L231 Difference]: Finished difference. Result has 73 places, 38 transitions, 226 flow [2024-06-20 19:45:11,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=38} [2024-06-20 19:45:11,756 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 44 predicate places. [2024-06-20 19:45:11,756 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 38 transitions, 226 flow [2024-06-20 19:45:11,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:11,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:11,756 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-20 19:45:11,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-20 19:45:11,757 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-20 19:45:11,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:11,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1577082655, now seen corresponding path program 10 times [2024-06-20 19:45:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:11,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736222] [2024-06-20 19:45:11,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:11,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736222] [2024-06-20 19:45:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736222] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:17,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:45:17,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611563008] [2024-06-20 19:45:17,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:17,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:45:17,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:45:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:45:17,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:17,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 38 transitions, 226 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:17,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:17,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:17,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:18,338 INFO L124 PetriNetUnfolderBase]: 82/179 cut-off events. [2024-06-20 19:45:18,338 INFO L125 PetriNetUnfolderBase]: For 2012/2012 co-relation queries the response was YES. [2024-06-20 19:45:18,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 179 events. 82/179 cut-off events. For 2012/2012 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 566 event pairs, 21 based on Foata normal form. 6/185 useless extension candidates. Maximal degree in co-relation 602. Up to 107 conditions per place. [2024-06-20 19:45:18,339 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 26 selfloop transitions, 11 changer transitions 13/52 dead transitions. [2024-06-20 19:45:18,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 52 transitions, 360 flow [2024-06-20 19:45:18,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:18,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:18,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2024-06-20 19:45:18,341 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303030303030303 [2024-06-20 19:45:18,341 INFO L175 Difference]: Start difference. First operand has 73 places, 38 transitions, 226 flow. Second operand 11 states and 109 transitions. [2024-06-20 19:45:18,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 52 transitions, 360 flow [2024-06-20 19:45:18,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 52 transitions, 332 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:45:18,344 INFO L231 Difference]: Finished difference. Result has 69 places, 33 transitions, 189 flow [2024-06-20 19:45:18,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=189, PETRI_PLACES=69, PETRI_TRANSITIONS=33} [2024-06-20 19:45:18,345 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 40 predicate places. [2024-06-20 19:45:18,345 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 33 transitions, 189 flow [2024-06-20 19:45:18,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:18,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:18,345 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-20 19:45:18,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-20 19:45:18,346 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-20 19:45:18,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 860550165, now seen corresponding path program 11 times [2024-06-20 19:45:18,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:18,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589509197] [2024-06-20 19:45:18,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:23,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:23,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589509197] [2024-06-20 19:45:23,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589509197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:23,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:23,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:45:23,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93131173] [2024-06-20 19:45:23,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:23,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:45:23,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:23,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:45:23,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:45:24,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:24,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 33 transitions, 189 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:24,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:24,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:24,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:24,258 INFO L124 PetriNetUnfolderBase]: 69/156 cut-off events. [2024-06-20 19:45:24,258 INFO L125 PetriNetUnfolderBase]: For 1578/1578 co-relation queries the response was YES. [2024-06-20 19:45:24,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 156 events. 69/156 cut-off events. For 1578/1578 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 461 event pairs, 19 based on Foata normal form. 6/162 useless extension candidates. Maximal degree in co-relation 520. Up to 95 conditions per place. [2024-06-20 19:45:24,259 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 24 selfloop transitions, 5 changer transitions 16/47 dead transitions. [2024-06-20 19:45:24,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 47 transitions, 311 flow [2024-06-20 19:45:24,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:24,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2024-06-20 19:45:24,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-20 19:45:24,260 INFO L175 Difference]: Start difference. First operand has 69 places, 33 transitions, 189 flow. Second operand 11 states and 105 transitions. [2024-06-20 19:45:24,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 47 transitions, 311 flow [2024-06-20 19:45:24,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 47 transitions, 283 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-20 19:45:24,262 INFO L231 Difference]: Finished difference. Result has 64 places, 28 transitions, 149 flow [2024-06-20 19:45:24,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=149, PETRI_PLACES=64, PETRI_TRANSITIONS=28} [2024-06-20 19:45:24,262 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-06-20 19:45:24,262 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 28 transitions, 149 flow [2024-06-20 19:45:24,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:24,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:24,263 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-20 19:45:24,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-20 19:45:24,263 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-20 19:45:24,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1584491965, now seen corresponding path program 12 times [2024-06-20 19:45:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118979471] [2024-06-20 19:45:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:30,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:30,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:30,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118979471] [2024-06-20 19:45:30,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118979471] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:30,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:30,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-20 19:45:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966554872] [2024-06-20 19:45:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:30,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 19:45:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 19:45:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-06-20 19:45:30,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:30,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 28 transitions, 149 flow. Second operand has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:30,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:30,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:30,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:31,015 INFO L124 PetriNetUnfolderBase]: 56/129 cut-off events. [2024-06-20 19:45:31,016 INFO L125 PetriNetUnfolderBase]: For 1196/1196 co-relation queries the response was YES. [2024-06-20 19:45:31,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 129 events. 56/129 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 333 event pairs, 17 based on Foata normal form. 6/135 useless extension candidates. Maximal degree in co-relation 420. Up to 60 conditions per place. [2024-06-20 19:45:31,016 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 17 selfloop transitions, 6 changer transitions 16/41 dead transitions. [2024-06-20 19:45:31,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 41 transitions, 255 flow [2024-06-20 19:45:31,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:31,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2024-06-20 19:45:31,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3151515151515151 [2024-06-20 19:45:31,017 INFO L175 Difference]: Start difference. First operand has 64 places, 28 transitions, 149 flow. Second operand 11 states and 104 transitions. [2024-06-20 19:45:31,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 41 transitions, 255 flow [2024-06-20 19:45:31,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 41 transitions, 237 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-20 19:45:31,018 INFO L231 Difference]: Finished difference. Result has 57 places, 21 transitions, 102 flow [2024-06-20 19:45:31,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=21} [2024-06-20 19:45:31,019 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2024-06-20 19:45:31,019 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 21 transitions, 102 flow [2024-06-20 19:45:31,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.230769230769231) internal successors, (94), 13 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:45:31,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:45:31,019 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-20 19:45:31,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-20 19:45:31,019 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-20 19:45:31,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:45:31,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1417253961, now seen corresponding path program 13 times [2024-06-20 19:45:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:45:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669348087] [2024-06-20 19:45:31,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:45:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:45:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:45:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:45:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:45:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669348087] [2024-06-20 19:45:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669348087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:45:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:45:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-20 19:45:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235973286] [2024-06-20 19:45:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:45:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-20 19:45:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:45:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-20 19:45:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-20 19:45:37,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-06-20 19:45:37,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 21 transitions, 102 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-20 19:45:37,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:45:37,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-06-20 19:45:37,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:45:37,355 INFO L124 PetriNetUnfolderBase]: 26/67 cut-off events. [2024-06-20 19:45:37,355 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2024-06-20 19:45:37,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 67 events. 26/67 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 6/73 useless extension candidates. Maximal degree in co-relation 176. Up to 24 conditions per place. [2024-06-20 19:45:37,356 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 0 selfloop transitions, 0 changer transitions 30/30 dead transitions. [2024-06-20 19:45:37,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 30 transitions, 154 flow [2024-06-20 19:45:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-20 19:45:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-20 19:45:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 95 transitions. [2024-06-20 19:45:37,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2878787878787879 [2024-06-20 19:45:37,357 INFO L175 Difference]: Start difference. First operand has 57 places, 21 transitions, 102 flow. Second operand 11 states and 95 transitions. [2024-06-20 19:45:37,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 30 transitions, 154 flow [2024-06-20 19:45:37,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 30 transitions, 122 flow, removed 1 selfloop flow, removed 16 redundant places. [2024-06-20 19:45:37,358 INFO L231 Difference]: Finished difference. Result has 42 places, 0 transitions, 0 flow [2024-06-20 19:45:37,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=42, PETRI_TRANSITIONS=0} [2024-06-20 19:45:37,358 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2024-06-20 19:45:37,358 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 0 transitions, 0 flow [2024-06-20 19:45:37,358 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-20 19:45:37,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-20 19:45:37,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-20 19:45:37,365 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-20 19:45:37,366 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-20 19:45:37,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-20 19:45:37,369 INFO L445 BasicCegarLoop]: Path program histogram: [21, 13, 13, 12, 9, 8, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:45:37,373 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-20 19:45:37,373 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-20 19:45:37,378 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-20 19:45:37,379 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-20 19:45:37,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 07:45:37 BasicIcfg [2024-06-20 19:45:37,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-20 19:45:37,380 INFO L158 Benchmark]: Toolchain (without parser) took 614094.55ms. Allocated memory was 151.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 115.2MB in the beginning and 729.3MB in the end (delta: -614.0MB). Peak memory consumption was 650.4MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,381 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:45:37,381 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 19:45:37,381 INFO L158 Benchmark]: CACSL2BoogieTranslator took 875.91ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 115.2MB in the beginning and 151.3MB in the end (delta: -36.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.18ms. Allocated memory is still 197.1MB. Free memory was 151.3MB in the beginning and 135.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,382 INFO L158 Benchmark]: Boogie Preprocessor took 127.66ms. Allocated memory is still 197.1MB. Free memory was 135.7MB in the beginning and 129.5MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,382 INFO L158 Benchmark]: RCFGBuilder took 1420.96ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 129.5MB in the beginning and 131.5MB in the end (delta: -2.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,382 INFO L158 Benchmark]: TraceAbstraction took 611522.91ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 223.3MB in the beginning and 729.3MB in the end (delta: -506.0MB). Peak memory consumption was 634.9MB. Max. memory is 16.1GB. [2024-06-20 19:45:37,383 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 151.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 875.91ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 115.2MB in the beginning and 151.3MB in the end (delta: -36.1MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.18ms. Allocated memory is still 197.1MB. Free memory was 151.3MB in the beginning and 135.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 127.66ms. Allocated memory is still 197.1MB. Free memory was 135.7MB in the beginning and 129.5MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1420.96ms. Allocated memory was 197.1MB in the beginning and 272.6MB in the end (delta: 75.5MB). Free memory was 129.5MB in the beginning and 131.5MB in the end (delta: -2.0MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. * TraceAbstraction took 611522.91ms. Allocated memory was 272.6MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 223.3MB in the beginning and 729.3MB in the end (delta: -506.0MB). Peak memory consumption was 634.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 813]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 814]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 48 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 611.4s, OverallIterations: 105, TraceHistogramMax: 1, PathProgramHistogramMax: 21, EmptinessCheckTime: 0.0s, AutomataDifference: 56.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6560 SdHoareTripleChecker+Valid, 34.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5638 mSDsluCounter, 4462 SdHoareTripleChecker+Invalid, 30.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3997 mSDsCounter, 1389 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37560 IncrementalHoareTripleChecker+Invalid, 38949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1389 mSolverCounterUnsat, 465 mSDtfsCounter, 37560 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1137 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 1130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 34.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1187occurred in iteration=46, InterpolantAutomatonStates: 971, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 549.4s InterpolantComputationTime, 1645 NumberOfCodeBlocks, 1645 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 1540 ConstructedInterpolants, 0 QuantifiedInterpolants, 75923 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 105 InterpolantComputations, 105 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-20 19:45:37,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE